Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A010099
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A010099 a(n) = a(n-1)*a(n-2). +0
2
1, 4, 4, 16, 64, 1024, 65536, 67108864, 4398046511104, 295147905179352825856, 1298074214633706907132624082305024, 383123885216472214589586756787577295904684780545900544 (list; graph; listen)
OFFSET

0,2
FORMULA

4^F(n), where F() = Fibonacci numbers A000045.

CROSSREFS

Adjacent sequences: A010096 A010097 A010098 this_sequence A010100 A010101 A010102

Sequence in context: A092266 A107382 A038788 this_sequence A060691 A075225 A091541

KEYWORD

nonn

AUTHOR

njas

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 October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research

Legal Notice
© 2007 AT&T Knowledge Ventures. All Rights Reserved.