The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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
 1, 2, 3, 8, 144, 9969216677189303386214405760200 (list; graph; refs; listen; history; text; internal format)
 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 Cf. A000045, A112601. Sequence in context: A005008 A079938 A324006 * A132502 A113840 A336292 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 24 07:20 EDT 2021. Contains 345416 sequences. (Running on oeis4.)