Advanced Search

Question: ternary strings

Question:ternary strings

Zeineb 540 Maple
digits recurrence
May 06 2019
1

Hi

Let s_n be the number of ternary strings (of 0s, 1s and 2s) of length n that have no
adjacent even digits.
For example, s_0 = 1 (the empty string),
s1 = 3 (the strings 0, 1 and 2),

while s2 = 5:  01; 10; 11; 12; 21;

We can compute by hand  Find s3; and we obtain 11
My question how can use maple to get a general recurrence relation for s_n. 

many think for your help
Please Wait...