cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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).

Original entry on oeis.org

1, 2, 3, 8, 144, 9969216677189303386214405760200
Offset: 1

Views

Author

Yasutoshi Kohmoto, Dec 22 2005

Keywords

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

Examples

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

Crossrefs

Extensions

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