Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080669
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080669 a(1) = 1; a(2) = 2; a(n) = Fibonacci(a(n-1) + a(n-2)) if n > 2. +0
1
1, 2, 2, 3, 5, 21, 121393 (list; graph; listen)
OFFSET

1,2

COMMENT

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 this_sequence A099205 A051005 A002163

Adjacent sequences: A080666 A080667 A080668 this_sequence A080670 A080671 A080672

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 9 14:43 EST 2009. Contains 170430 sequences.


AT&T Labs Research