A recurrence relation for counting binary strings of length $n$ with no two consecutive 1's is $b_n = b_{n-1} + b_{n-2}$ with appropriate initial conditions. What are the correct initial conditions?