Let fn denote the number of ways of tossing a coin n times such that successive heads never appear. Argue that
, where f0 = 1, f1 = 2
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.