login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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
Sequence in context: A005008 A079938 A324006 * A371225 A132502 A113840
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)