# I need help coming up with a recurrence relation that models the folowing problem: $ Come up with a recurrence relation, a_{n}, that counts the number of n-length ternary sequences that do not contain the subsequence "211" anywhere. $