|
Search: id:A112237
|
|
|
| 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). |
|
+0
5
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The next term, a(7)=f(9969216677189303386214405760211), has tens of thousands of digits at least, and is too large to include. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 14 2006
|
|
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: A042815 A005008 A079938 this_sequence A132502 A113840 A075849
Adjacent sequences: A112234 A112235 A112236 this_sequence A112238 A112239 A112240
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Yasutsohi Kohmoto zbi74583(AT)boat.zero.ad.jp, Dec 22 2005
|
|
EXTENSIONS
|
a(6)=f(149) from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 14 2006
|
|
|
Search completed in 0.002 seconds
|
