Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101341
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101341 Fibonacci-Fermat numbers. +0
1
2, 5, 1597, 229265413057075367692743352179590077832064383222590237 (list; graph; listen)
OFFSET

0,1

FORMULA

Fibonacci(2^(2^x)+1) == Fibonacci(Fermat(x))

PROGRAM

(PARI) for(x=0, 4, print( fibonacci(2^(2^x)+1) )

CROSSREFS

Adjacent sequences: A101338 A101339 A101340 this_sequence A101342 A101343 A101344

Sequence in context: A078748 A051131 A119748 this_sequence A079014 A082973 A082815

KEYWORD

nonn

AUTHOR

Jorge Coveiro (jorgecoveiro(AT)yahoo.com), Dec 24 2004

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 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research