Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101342
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101342 Fibonacci-Mersenne numbers. +0
2
0, 1, 2, 13, 610, 1346269, 6557470319842, 155576970220531065681649693, 87571595343018854458033386304178158174356588264390370, 27745922289305716855338470916082815029348872029647830861914852073402148308000613611082094085891168867554589 (list; graph; listen)
OFFSET

0,3

FORMULA

Fibonacci(Mersenne(n)) == Fibonacci(2^n-1)

Apparently a(n)=A088334(n-2)-1. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 23 2007

PROGRAM

(PARI) for(x=0, 10, print( fibonacci(2^x-1) ))

CROSSREFS

Sequence in context: A013048 A012981 A013111 this_sequence A119122 A109947 A064185

Adjacent sequences: A101339 A101340 A101341 this_sequence A101343 A101344 A101345

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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research