Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058051
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058051 F(F(F(n))), where F is a Fibonacci number (A000045). +0
1
0, 1, 1, 1, 1, 5, 10946, 2211236406303914545699412969744873993387956988653 (list; graph; listen)
OFFSET

1,6

MATHEMATICA

F[0] = 0; F[1] = 1; F[n_] := F[n] = F[n - 1] + F[n - 2]; Table[ F[ F[ F[n] ] ], {n, 0, 10} ]

CROSSREFS

Cf. A000045.

Sequence in context: A052027 A109514 A022918 this_sequence A089989 A083976 A013834

Adjacent sequences: A058048 A058049 A058050 this_sequence A058052 A058053 A058054

KEYWORD

easy,nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 18 2000

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research