Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101329
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101329 2^(2^(2^x)+1)-1 = M(F(x)) == Mersenne(Fermat(x)) +0
1
7, 31, 131071, 231584178474632390847141970017375815706539969331281128078915168015826259279871 (list; graph; listen)
OFFSET

0,1

COMMENT

Mersenne-Fermat numbers.

FORMULA

a(n) = A070969(2^n)-2. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 22 2007

EXAMPLE

M(F(0))=7

M(F(1))=31

M(F(2))=131071

M(F(3))=31231584178474632390847141970017375815706539969331281128078915168015826259279871

PROGRAM

(PARI) for(x=0, 3, print(2^(2^(2^x)+1)-1))

CROSSREFS

Sequence in context: A134709 A139314 A163083 this_sequence A164819 A067811 A044084

Adjacent sequences: A101326 A101327 A101328 this_sequence A101330 A101331 A101332

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 December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research