Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119562
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119562 Let F(n) = 2^(2^n) + 1 = the n-th Fermat number, M(n) = 2^n - 1 = the n-th Mersenne number. Then a(n) = F(n) - M(n) + 1 = 2^(2^n) + 1 - (2^n - 1) + 1 = 2^(2^n) - 2^n + 3. +0
1
4, 5, 15, 251, 65523, 4294967267, 18446744073709551555, 340282366920938463463374607431768211331, 115792089237316195423570985008687907853269984665640564039457584007913129639683 (list; graph; listen)
OFFSET

0,1

FORMULA

a(n) = A001146(n)-A000079(n)+3 = A119564(n)+2. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 15 2007

EXAMPLE

F(1) = 2^(2^1)+1 = 5

M(1) = 2^1-1 = 1

F(1) - M(2) + 1 = 5

PROGRAM

(PARI) fm2(n) = for(x=0, n, y=2^(2^x)-2^x+3; print1(y", "))

CROSSREFS

Sequence in context: A006491 A051721 A050226 this_sequence A166590 A085768 A166304

Adjacent sequences: A119559 A119560 A119561 this_sequence A119563 A119564 A119565

KEYWORD

nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), May 31 2006

EXTENSIONS

Definition corrected by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 15 2007

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research