|
| |
|
|
A160021
|
|
a(n)=2^(2^n)+33, Fermat numbers of order 33.
|
|
0
| |
|
|
35, 37, 49, 289, 65569, 4294967329, 18446744073709551649, 340282366920938463463374607431768211489, 115792089237316195423570985008687907853269984665640564039457584007913129639969
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Fermat numbers of order m are defined by F(n,m) = 2^(2^n)+m = A001146(n)+m.
F(1,33) = 37 is the only prime in this sequence. (If n is even, 7 divides
F(n,33). For n > 2, 17 divides F(n,33). Proofs are in the link.)
|
|
|
LINKS
| Cino Hilliard, Fermat numbers of order m
|
|
|
PROG
| (PARI) g(n) = for(x=0, n, y=2^(2^x)+33; print1(y", "))
|
|
|
CROSSREFS
| Cf. A130730 (order 7).
Sequence in context: A064993 A041611 A160775 * A172016 A064610 A030589
Adjacent sequences: A160018 A160019 A160020 * A160022 A160023 A160024
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)hotmail.com), Apr 30 2009
|
|
|
EXTENSIONS
| Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 08 2009
|
| |
|
|
