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 A006315 M5208 #42 Sep 08 2022 08:44:34
%S A006315 1,30,54,96,112,114,132,156,332,342,360,376,428,430,432,448,562,588,
%T A006315 726,738,804,850,884,1068,1142,1198,1306,1540,1568,1596,1678,1714,
%U A006315 1754,1812,1818,1878,1906,1960,1962,2046,2098,2118,2142,2330,2418,2434,2654,2668
%N A006315 Numbers n such that n^32 + 1 is prime.
%D A006315 Dubner, Harvey. "Generalized Fermat primes." J. Recreational Math., 18 (1985): 279-280.
%D A006315 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006315 Ray Chandler, <a href="/A006315/b006315.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from T. D. Noe)
%t A006315 lst={};Do[If[PrimeQ[n^32+1], Print[n];AppendTo[lst, n]], {n, 10^5}];lst (* _Vladimir Joseph Stephan Orlovsky_, Aug 21 2008 *)
%t A006315 Select[Range[0, 2700], PrimeQ[(#^32 + 1)] &] (* _Vincenzo Librandi_, Sep 25 2012 *)
%o A006315 (PARI) isA006315(n) = isprime(n^32+1) \\ _Michael B. Porter_, Mar 26 2010
%o A006315 (Magma)[n: n in [1..3000] | IsPrime(n^32 + 1)]; // _Vincenzo Librandi_, Sep 25 2012
%Y A006315 Cf. A005574, A000068, A006314, A006313, A006316, A056994, A056995, A057465, A057002, A088361, A088362, A226528, A226529, A226530, A251597, A253854, A244150, A243959, A321323.
%K A006315 nonn,easy
%O A006315 1,2
%A A006315 _N. J. A. Sloane_
%E A006315 More terms from _Hugo Pfoertner_, Jun 22 2003