Problem
COM-B1-M10-P008 Strings of Length \(8\)
#8
★★☆☆☆ Level 2 of 5
How many binary strings of length \(8\) contain no two adjacent ones?
Initial values are \(a_0=1\), \(a_1=2\).
The recurrence is \(a_n=a_{n-1}+a_{n-2}\). Thus \(a_2=3\), \(a_3=5\), \(a_4=8\), \(a_5=13\), \(a_6=21\), \(a_7=34\), \(a_8=55\).
Same recurrence, different start.