1, 1, 2, 5, 21, 233, 10946, ?...?

Let F(n) stand for the nth Fibonnaci number.

The sequence in question is F(F(n+2)+1)

At first I thought it was just F(F(n)) but that would start off 1,1,1,2,5,...

Because the sequence of F(n) starts 0,1,1,2,3,5...  it needs to be shifted a bit.

-Jer

***Forgot to mention: I agree with Syzygy's solution***

Edited on November 15, 2004, 12:29 pm

Posted by Jer on 2004-11-15 12:28:50