This is a classic problem: number of binary strings of length \(n\) with no two consecutive 1’s is \(F_n+2\), where \(F_n\) is the Fibonacci sequence. - American Beagle Club