Let T n be the number of ternary base 3 sequences i e

Last updated: 5/6/2023

Let T n be the number of ternary base 3 sequences i e character strings of O s 1 s and 2 s of length n that have no consecutive zeroes for n 1 Find a recurrence relation that relates T n to T n 1 and T n 2 Solve this recurrence relation Prove by induction that your answer