|
| |
|
|
A119564
|
|
Define F(n) = 2^(2^n)+1 = 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) - 2^n + 1.
|
|
2
| |
|
|
2, 3, 13, 249, 65521, 4294967265, 18446744073709551553, 340282366920938463463374607431768211329, 115792089237316195423570985008687907853269984665640564039457584007913129639681
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
EXAMPLE
| F(2) = 2^(2^2)+1 = 17, M(2) = 2^2-1 = 3, F(2)-M(2)-1 = 13.
|
|
|
PROG
| (PARI) fm4(n) = for(x=0, n, y=2^(2^x)+1-(2^x-1)-1; print1(y", "))
|
|
|
CROSSREFS
| Cf. A119550, A119563.
Sequence in context: A139520 A132535 A056806 * A132358 A090100 A132484
Adjacent sequences: A119561 A119562 A119563 * A119565 A119566 A119567
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)gmail.com), May 31 2006
|
|
|
EXTENSIONS
| Edited by N. J. A. Sloane (njas(AT)research.att.com), Jun 03 2006
Definition corrected by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 15 2007
|
| |
|
|
