|
|
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).
|
|
4
|
|
|
|
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
|
|
|
EXAMPLE
|
a(5)=Fibonacci(3+8)=144 because a(3) is third Fibonacci number and a(4)=8.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|