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 A006316 M5368 #56 Sep 08 2022 08:44:34
%S A006316 1,102,162,274,300,412,562,592,728,1084,1094,1108,1120,1200,1558,1566,
%T A006316 1630,1804,1876,2094,2162,2164,2238,2336,2388,2420,2494,2524,2614,
%U A006316 2784,3024,3104,3140,3164,3254,3278,3628,3694,3738,3750,4000,4030,4058,4166
%N A006316 Numbers k such that k^64 + 1 is prime.
%D A006316 Harvey Dubner, Generalized Fermat primes, J. Recreational Math., 18 (1985): 279-280.
%D A006316 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006316 Simon Plouffe, <a href="/A006316/b006316.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from T. D. Noe)
%t A006316 lst={};Do[If[PrimeQ[n^64+1], Print[n];AppendTo[lst, n]], {n, 10^4}];lst (* _Vladimir Joseph Stephan Orlovsky_, Aug 21 2008 *)
%t A006316 Select[Range[0, 4200], PrimeQ[(#^64 + 1)] &] (* _Vincenzo Librandi_, Sep 25 2012 *)
%o A006316 (PARI) isA006316(n) = isprime(n^64+1) \\ _Michael B. Porter_, Mar 28 2010
%o A006316 (Magma) [n: n in [1..4200] | IsPrime(n^64 + 1)]; // _Vincenzo Librandi_, Sep 25 2012
%Y A006316 Cf. A005574, A000068, A006314, A006313, A006315, A056994, A056995, A057465, A057002, A088361, A088362, A226528, A226529, A226530, A251597, A253854, A244150, A243959, A321323.
%K A006316 nonn,easy
%O A006316 1,2
%A A006316 _N. J. A. Sloane_, _Robert G. Wilson v_
%E A006316 More terms from _Hugo Pfoertner_, Jun 22 2003