cp's OEIS Frontend

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.

A006314 Numbers k such that k^8 + 1 is prime.

This page as a plain text file.
%I A006314 M1308 #57 Jul 02 2025 16:01:54
%S A006314 1,2,4,118,132,140,152,208,240,242,288,290,306,378,392,426,434,442,
%T A006314 508,510,540,542,562,596,610,664,680,682,732,782,800,808,866,876,884,
%U A006314 892,916,918,934,956,990,1022,1028,1054,1106,1120,1174,1224,1232,1256,1284
%N A006314 Numbers k such that k^8 + 1 is prime.
%D A006314 Dubner, Harvey. "Generalized Fermat primes." J. Recreational Math., 18 (1985): 279-280.
%D A006314 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006314 T. D. Noe, <a href="/A006314/b006314.txt">Table of n, a(n) for n=1..10000</a>
%F A006314 A258805(n) = a(n)^8+1. - _R. J. Mathar_, Jun 05 2025
%t A006314 Select[Range[1300],PrimeQ[#^8+1]&]  (* _Harvey P. Dale_, Mar 31 2011 *)
%o A006314 (PARI) isA006314(n) = isprime(n^8+1) \\ _Michael B. Porter_, Mar 24 2010
%o A006314 (Magma) [n: n in [0..2000] | IsPrime(n^8+1)]; // _Vincenzo Librandi_, Nov 18 2010
%Y A006314 Cf. A005574, A000068, A006313, A006315, A006316, A056994, A056995, A057465, A057002, A088361, A088362, A226528, A226529, A226530, A251597, A253854, A244150, A243959, A321323.
%K A006314 nonn,easy
%O A006314 1,2
%A A006314 _N. J. A. Sloane_
%E A006314 More terms from _James Sellers_, May 03 2000