login
This site is supported by donations 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; internal format)
OFFSET

1,2

COMMENTS

a(8) has 25374 digits.

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: A152446 A055937 A090255 * A099205 A051005 A002163

Adjacent sequences:  A080666 A080667 A080668 * A080670 A080671 A080672

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Mar 02 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.