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!)
A080669 a(1) = 1; a(2) = 2; a(n) = Fibonacci(a(n-1) + a(n-2)) if n > 2. 0
1, 2, 2, 3, 5, 21, 121393 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(8) has 25374 digits.
LINKS
MATHEMATICA
t = {1, 2}; For[i = 1, i <= 5, i++, l = Length[t]; t = Append[t, Fibonacci[t[[l]] + t[[l - 1]]]]]; t
CROSSREFS
Sequence in context: A055937 A090255 A228162 * A099205 A051005 A266583
KEYWORD
nonn
AUTHOR
Joseph L. Pe, Mar 02 2003
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 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)