Question 11
Count binary strings (made only of 0 and 1) with no two adjacent ones, such as 010010001. The table records counts for length N.
For N=1 the strings are 0,1; for N=2 they are 00,01,10; for N=3 they are 000,100,010,001,101. How should the complete count row read?
For N=1 the strings are 0,1; for N=2 they are 00,01,10; for N=3 they are 000,100,010,001,101. How should the complete count row read?