This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A160021 #17 Sep 08 2022 08:45:44
%S A160021 35,37,49,289,65569,4294967329,18446744073709551649,
%T A160021 340282366920938463463374607431768211489,
%U A160021 115792089237316195423570985008687907853269984665640564039457584007913129639969
%N A160021 a(n)=2^(2^n)+33, Fermat numbers of order 33.
%C A160021 Fermat numbers of order m are defined by F(n,m) = 2^(2^n)+m = A001146(n)+m.
%C A160021 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.)
%H A160021 Vincenzo Librandi, <a href="/A160021/b160021.txt">Table of n, a(n) for n = 1..12</a>
%H A160021 Cino Hilliard, <a href="http://groups.google.com/group/numbertheory/web/fermat-numbers-of-order-m">Fermat numbers of order m</a>
%t A160021 Table[(2^(2^n) + 33), {n, 0, 15}] (* _Vincenzo Librandi_, Jan 09 2013 *)
%o A160021 (PARI) g(n) = for(x=0,n,y=2^(2^x)+33;print1(y","))
%o A160021 (Magma) [2^(2^n)+33: n in [0..11]]; // _Vincenzo Librandi_, Jan 09 2013
%Y A160021 Cf. A130730 (order 7).
%K A160021 nonn
%O A160021 1,1
%A A160021 _Cino Hilliard_, Apr 30 2009
%E A160021 Edited by _R. J. Mathar_, May 08 2009