A112237 If a(n-2) is the i-th Fibonacci number then a(n)=Fibonacci(i+a(n-1)); with a(1)=1, a(2)=2 and where we use the following nonstandard indexing for the Fibonacci numbers: f(n)=f(n-1)+f(n-2), f(1)=1, f(2)=2 (cf. A000045).

1, 2, 3, 8, 144, 9969216677189303386214405760200

Offset

1,2

Comments

The next term, a(7)=f(9969216677189303386214405760211), has tens of thousands of digits at least and is too large to include. - R. J. Mathar, Oct 14 2006

Links

Table of n, a(n) for n=1..6.

Example

a(5)=Fibonacci(3+8)=144 because a(3) is third Fibonacci number and a(4)=8.

Crossrefs

Cf. A000045, A112601.

Sequence in context: A005008 A079938 A324006 * A371225 A132502 A113840

Adjacent sequences: A112234 A112235 A112236 * A112238 A112239 A112240

Keyword

nonn

Author

Yasutoshi Kohmoto, Dec 22 2005

Extensions

a(6)=f(149) from R. J. Mathar, Oct 14 2006

Status

approved