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
Vincenzo Librandi, Table of n, a(n) for n = 1..12
Cino Hilliard, Fermat numbers of order m
MATHEMATICA
Table[(2^(2^n) + 33), {n, 0, 15}] (* Vincenzo Librandi, Jan 09 2013 *)
PROG
(PARI) g(n) = for(x=0, n, y=2^(2^x)+33; print1(y", "))
(Magma) [2^(2^n)+33: n in [0..11]]; // Vincenzo Librandi, Jan 09 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
Cino Hilliard, Apr 30 2009
EXTENSIONS
Edited by R. J. Mathar, May 08 2009
STATUS
approved