A000068 -id:A000068 - cp's OEIS frontend

A337607 Decimal expansion of Shanks's constant: the Hardy-Littlewood constant for A000068.

6, 6, 9, 7, 4, 0, 9, 6, 9, 9, 3, 7, 0, 7, 1, 2, 2, 0, 5, 3, 8, 9, 2, 2, 4, 3, 1, 5, 7, 1, 7, 6, 4, 4, 0, 6, 6, 8, 8, 3, 7, 0, 1, 5, 7, 4, 3, 6, 4, 8, 2, 4, 1, 8, 5, 7, 3, 2, 9, 8, 5, 2, 2, 8, 4, 5, 2, 4, 6, 7, 9, 9, 9, 5, 6, 4, 5, 7, 1, 4, 7, 2, 7, 3, 1, 5, 0, 6, 2, 1, 0, 2, 1, 4, 3, 5, 9, 3, 7, 3, 5, 0, 2, 7, 3, 2

Offset: 0

Amiram Eldar, Sep 04 2020

Named by Finch (2003) after the American mathematician Daniel Shanks (1917 - 1996).
Shanks (1961) conjectured that the number of primes of the form m^4 + 1 (A037896) with m <= x is asymptotic to c * li(x), where li(x) is the logarithmic integral function and c is this constant. He defined c as in the formula section and evaluated it by 0.66974.
The first 100 digits of this constant were calculated by Ettahri et al. (2019).

			0.669740969937071220538922431571764406688370157436482...

Steven R. Finch, Mathematical Constants, Cambridge University Press, 2003, p. 90.

Keith Conrad, Hardy-Littlewood constants in: Mathematical properties of sequences and other combinatorial structures, Jong-Seon No et al. (eds.), Kluwer, Boston/Dordrecht/London, 2003, pp. 133-154, alternative link.
Salma Ettahri, Olivier Ramaré, Léon Surel, Fast multi-precision computation of some Euler products, arXiv:1908.06808 [math.NT], 2019 (Corollary 1.8).
Mohan Lal, Primes of the form n^4 + 1, Mathematics of Computation, Vol. 21, No. 98 (1967), pp. 245-247.
Daniel Shanks, On Numbers of the form n^4 + 1, Mathematics of Computation, Vol. 15, No. 74 (1961), pp. 186-189.
Daniel Shanks, Lal's constant and generalizations, Mathematics of Computation, Vol. 21, No. 100 (1967), pp. 705-707.
Eric Weisstein's World of Mathematics, Lal's Constant.

Cf. A000068, A037896, A088367, A334826.

Similar constants: A005597, A331941, A337606, A337608.

S[m_, n_, s_] := (t = 1; sums = 0; difs = 1; While[Abs[difs] > 10^(-digits - 5) || difs == 0, difs = (MoebiusMu[t]/t) * Log[If[s*t == 1, DirichletL[m, n, s*t], Sum[Zeta[s*t, j/m]*DirichletCharacter[m, n, j]^t, {j, 1, m}]/m^(s*t)]]; sums = sums + difs; t++]; sums);
P[m_, n_, s_] := 1/EulerPhi[m] * Sum[Conjugate[DirichletCharacter[m, r, n]] * S[m, r, s], {r, 1, EulerPhi[m]}] + Sum[If[GCD[p, m] > 1 && Mod[p, m] == n, 1/p^s, 0], {p, 1, m}];
Z[m_, n_, s_] := (w = 1; sumz = 0; difz = 1; While[Abs[difz] > 10^(-digits - 5), difz = P[m, n, s*w]/w; sumz = sumz + difz; w++]; Exp[sumz]);
Zs[m_, n_, s_] := (w = 2; sumz = 0; difz = 1; While[Abs[difz] > 10^(-digits - 5), difz = (s^w - s) * P[m, n, w]/w; sumz = sumz + difz; w++]; Exp[-sumz]);
$MaxExtraPrecision = 1000; digits = 121; RealDigits[Chop[N[Pi^2/(16*Log[1+Sqrt[2]]) * Zs[8, 1, 4]/Z[8, 1, 2]^2, digits]], 10, digits-1][[1]] (* Vaclav Kotesovec, Jan 15 2021 *)

Equals (Pi^2/(16*log(1+sqrt(2)))) * Product_{primes p == 1 (mod 8)} (1 - 4/p)*((p + 1)/(p - 1))^2 = (Pi/8) * A088367 * A334826.

More digits from Vaclav Kotesovec, Jan 15 2021

A005574 Numbers k such that k^2 + 1 is prime.

Original entry on oeis.org

1, 2, 4, 6, 10, 14, 16, 20, 24, 26, 36, 40, 54, 56, 66, 74, 84, 90, 94, 110, 116, 120, 124, 126, 130, 134, 146, 150, 156, 160, 170, 176, 180, 184, 204, 206, 210, 224, 230, 236, 240, 250, 256, 260, 264, 270, 280, 284, 300, 306, 314, 326, 340, 350, 384, 386, 396

Offset: 1

N. J. A. Sloane

Hardy and Littlewood conjectured that the asymptotic number of elements in this sequence not exceeding n is approximately c*sqrt(n)/log(n) for some constant c. - Stefan Steinerberger, Apr 06 2006
Also, nonnegative integers such that a(n)+i is a Gaussian prime. - Maciej Ireneusz Wilczynski, May 30 2011
Apparently Goldbach conjectured that any a > 1 from this sequence can be written as a=b+c where b and c are in this sequence (Lemmermeyer link below). - Jeppe Stig Nielsen, Oct 14 2015
No term > 2 can be both in this sequence and in A001105 because of the Aurifeuillean factorization (2*k^2)^2 + 1 = (2*k^2 - 2*k + 1) * (2*k^2 + 2*k + 1). - Jeppe Stig Nielsen, Aug 04 2019

Harvey Dubner, "Generalized Fermat primes", J. Recreational Math., 18 (1985): 279-280.
R. K. Guy, "Unsolved Problems in Number Theory", 3rd edition, A2.
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, p. 15, Thm. 17.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 1..10000
H. Dubner, Generalized Fermat primes, J. Recreational Math. 18.4 (1985-1986), 279. (Annotated scanned copy)
F. Ellermann, Primes of the form (m^2)+1 up to 10^6.
L. Euler, Lettre CXLIX (to Goldbach), 1752.
L. Euler, De numeris primis valde magnis, Novi Commentarii academiae scientiarum Petropolitanae 9 (1764), pp. 99-153. See pp. 123-125.
R. K. Guy, Letter to N. J. A. Sloane, 1988-04-12 (annotated scanned copy).
F. Lemmermeyer, Primes of the form a^2+1, Math Overflow question (2010).
Eric Weisstein's World of Mathematics, Landau's Problems.
Eric Weisstein's World of Mathematics, Power.
Eric Weisstein's World of Mathematics, Near-Square Prime.
Marek Wolf, Search for primes of the form m^2+1, arXiv:0803.1456 [math.NT], 2008-2010.

Cf. A002522, A001912, A002496, A062325, A090693, A000068, A006314, A006313, A006315, A006316, A056994, A056995, A057465, A057002, A088361, A088362, A226528, A226529, A226530, A251597, A253854, A244150, A243959, A321323.
Other sequences of the type "Numbers k such that k^2 + i is prime": this sequence (i=1), A067201 (i=2), A049422 (i=3), A007591 (i=4), A078402 (i=5), A114269 (i=6), A114270 (i=7), A114271 (i=8), A114272 (i=9), A114273 (i=10), A114274 (i=11), A114275 (i=12).
Cf. A010051, A259645, A295405 (characteristic function).

a005574 n = a005574_list !! (n-1)
a005574_list = filter ((== 1) . a010051' . (+ 1) . (^ 2)) [0..]
-- Reinhard Zumkeller, Jul 03 2015

[n: n in [0..400] | IsPrime(n^2+1)]; // Vincenzo Librandi, Nov 18 2010

Select[Range[350], PrimeQ[ #^2 + 1] &] (* Stefan Steinerberger, Apr 06 2006 *)
Join[{1},2Flatten[Position[PrimeQ[Table[x^2+1,{x,2,1000,2}]],True]]]  (* Fred Patrick Doty, Aug 18 2017 *)

isA005574(n) = isprime(n^2+1) \\ Michael B. Porter, Mar 20 2010

for(n=1, 1e3, if(isprime(n^2 + 1), print1(n, ", "))) \\ Altug Alkan, Oct 14 2015

from sympy import isprime; [print(n, end = ', ') for n in range(1, 400) if isprime(n*n+1)] # Ya-Ping Lu, Apr 23 2025

a(n) = A090693(n) - 1.

a(n) = 2*A001912(n-1) for n > 1. - Jeppe Stig Nielsen, Aug 04 2019

A006313 Numbers k such that k^16 + 1 is prime.

Original entry on oeis.org

1, 2, 44, 74, 76, 94, 156, 158, 176, 188, 198, 248, 288, 306, 318, 330, 348, 370, 382, 396, 452, 456, 470, 474, 476, 478, 560, 568, 598, 642, 686, 688, 690, 736, 774, 776, 778, 790, 830, 832, 834, 846, 900, 916, 946, 956, 972, 982, 984, 1018, 1044, 1078

Offset: 1

N. J. A. Sloane

nonn

Dubner, Harvey. "Generalized Fermat primes." J. Recreational Math., 18 (1985): 279-280.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Ray Chandler, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)

Cf. A005574, A000068, A006314, A006315, A006316, A056994, A056995, A057465, A057002, A088361, A088362, A226528, A226529, A226530, A251597, A253854, A244150, A243959, A321323.

[ n: n in [0..1500] | IsPrime(n^16+1) ]; // Vincenzo Librandi, Nov 18 2010

lst={};Do[If[PrimeQ[n^16+1], AppendTo[lst, n]], {n, 10^4}];lst (* Vladimir Joseph Stephan Orlovsky, Aug 20 2008 *)
s=Reap[Sow[1];Do[If[PrimeQ[n^16+1],Sow[n]],{n,2,40352,2}]][[2,1]] (* Zak Seidov, Dec 22 2010 *)
Join[{1},2*Flatten[Position[Range[2,1100,2]^16+1,?PrimeQ]]] (* _Harvey P. Dale, Jun 26 2017 *)

isA006313(n) = isprime(n^16+1) \\ Michael B. Porter, Mar 25 2010

More terms from Hugo Pfoertner, Jun 22 2003

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

Original entry on oeis.org

1, 2, 4, 118, 132, 140, 152, 208, 240, 242, 288, 290, 306, 378, 392, 426, 434, 442, 508, 510, 540, 542, 562, 596, 610, 664, 680, 682, 732, 782, 800, 808, 866, 876, 884, 892, 916, 918, 934, 956, 990, 1022, 1028, 1054, 1106, 1120, 1174, 1224, 1232, 1256, 1284

Offset: 1

N. J. A. Sloane

Dubner, Harvey. "Generalized Fermat primes." J. Recreational Math., 18 (1985): 279-280.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n=1..10000

Cf. A005574, A000068, A006313, A006315, A006316, A056994, A056995, A057465, A057002, A088361, A088362, A226528, A226529, A226530, A251597, A253854, A244150, A243959, A321323.

[n: n in [0..2000] | IsPrime(n^8+1)]; // Vincenzo Librandi, Nov 18 2010

Select[Range[1300],PrimeQ[#^8+1]&]  (* Harvey P. Dale, Mar 31 2011 *)

isA006314(n) = isprime(n^8+1) \\ Michael B. Porter, Mar 24 2010

A258805(n) = a(n)^8+1. - R. J. Mathar, Jun 05 2025

More terms from James Sellers, May 03 2000

A246392 Numbers n such that Phi(10, n) is prime, where Phi is the cyclotomic polynomial.

Original entry on oeis.org

2, 3, 5, 10, 11, 12, 16, 20, 21, 22, 33, 37, 38, 43, 47, 48, 55, 71, 75, 76, 80, 81, 111, 121, 126, 131, 133, 135, 136, 141, 155, 157, 158, 165, 176, 177, 180, 203, 223, 242, 245, 251, 253, 256, 257, 258, 265, 268, 276, 286, 290, 297, 307, 322, 323, 342, 361, 363, 366, 375, 377, 385, 388, 396, 411

Offset: 1

Eric Chen, Nov 13 2014

nonn

Numbers n such that (n^5+1)/(n+1) is prime, or numbers n such that A060884(n) is prime.

Ray Chandler, Table of n, a(n) for n = 1..10000 (first 893 terms from Robert Price)
OEIS Wiki, Cyclotomic Polynomials at x=sigma(n)

Cf. A008864 (1), A006093 (2), A002384 (3), A005574 (4), A049409 (5), A055494 (6), A100330 (7), A000068 (8), A153439 (9), this sequence (10), A162862 (11), A246397 (12), A217070 (13), A006314 (16), A217071 (17), A164989 (18), A217072 (19), A217073 (23), A153440 (27), A217074 (29), A217075 (31), A006313 (32), A097475 (36), A217076 (37), A217077 (41), A217078 (43), A217079 (47), A217080 (53), A217081 (59), A217082 (61), A006315 (64), A217083 (67), A217084 (71), A217085 (73), A217086 (79), A153441 (81), A217087 (83), A217088 (89), A217089 (97), A006316 (128), A153442 (243), A056994 (256), A056995 (512), A057465 (1024), A057002 (2048), A088361 (4096), A088362 (8192), A226528 (16384), A226529 (32768), A226530 (65536).

Cf. A060884, A085398, A259257.

[n: n in [1..500]| IsPrime((n^5+1) div (n+1))]; // Vincenzo Librandi, Nov 14 2014

A246392:=n->`if`(isprime((n^5+1)/(n+1)),n,NULL): seq(A246392(n), n=1..500); # Wesley Ivan Hurt, Nov 15 2014

Select[Range[700], PrimeQ[(#^5 + 1) / (# + 1)] &] (* Vincenzo Librandi, Nov 14 2014 *)

for(n=1,10^3,if(isprime(polcyclo(10,n)),print1(n,", "))); \\ Joerg Arndt, Nov 13 2014

A056994 Numbers k such that k^128 + 1 is prime.

Original entry on oeis.org

1, 120, 190, 234, 506, 532, 548, 960, 1738, 1786, 2884, 3000, 3420, 3476, 3658, 4258, 5788, 6080, 6562, 6750, 7692, 8296, 9108, 9356, 9582, 9706, 10238, 10994, 11338, 11432, 11466, 11554, 11778, 12704, 12766, 13082, 13478, 13700

Offset: 1

Robert G. Wilson v, Sep 06 2000

nonn

Dubner, Harvey. "Generalized Fermat primes." J. Recreational Math., 18 (1985): 279-280.

Ray Chandler, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
Yves Gallot, Generalized Fermat Prime Search.

Cf. A005574, A000068, A006314, A006313, A006315, A006316, A056995, A057465, A057002, A088361, A088362, A226528, A226529, A226530, A251597, A253854, A244150, A243959, A321323.

Do[ k = 1; While[ PowerMod[ n, 128, 2*k*128 + 1 ] != 2*k*128 && k < 10^3, k++ ]; If[ k == 10^3 && PrimeQ[ n^128 + 1 ], Print[ n ] ], {n, 2, 15000, 2} ]

isA056994(n) = isprime(n^128+1) \\ Michael B. Porter, Mar 30 2010

A006315 Numbers n such that n^32 + 1 is prime.

Original entry on oeis.org

1, 30, 54, 96, 112, 114, 132, 156, 332, 342, 360, 376, 428, 430, 432, 448, 562, 588, 726, 738, 804, 850, 884, 1068, 1142, 1198, 1306, 1540, 1568, 1596, 1678, 1714, 1754, 1812, 1818, 1878, 1906, 1960, 1962, 2046, 2098, 2118, 2142, 2330, 2418, 2434, 2654, 2668

Offset: 1

N. J. A. Sloane

Dubner, Harvey. "Generalized Fermat primes." J. Recreational Math., 18 (1985): 279-280.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Ray Chandler, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)

Cf. A005574, A000068, A006314, A006313, A006316, A056994, A056995, A057465, A057002, A088361, A088362, A226528, A226529, A226530, A251597, A253854, A244150, A243959, A321323.

[n: n in [1..3000] | IsPrime(n^32 + 1)]; // Vincenzo Librandi, Sep 25 2012

lst={};Do[If[PrimeQ[n^32+1], Print[n];AppendTo[lst, n]], {n, 10^5}];lst (* Vladimir Joseph Stephan Orlovsky, Aug 21 2008 *)
Select[Range[0, 2700], PrimeQ[(#^32 + 1)] &] (* Vincenzo Librandi, Sep 25 2012 *)

isA006315(n) = isprime(n^32+1) \\ Michael B. Porter, Mar 26 2010

More terms from Hugo Pfoertner, Jun 22 2003

A056993 a(n) is the smallest k >= 2 such that k^(2^n)+1 is prime, or -1 if no such k exists.

Original entry on oeis.org

2, 2, 2, 2, 2, 30, 102, 120, 278, 46, 824, 150, 1534, 30406, 67234, 70906, 48594, 62722, 24518, 75898, 919444

Offset: 0

Robert G. Wilson v, Sep 06 2000

Smallest base value yielding generalized Fermat primes. - Hugo Pfoertner, Jul 01 2003
The first 5 terms correspond with the known (ordinary) Fermat primes. A probable candidate for the next entry is 62722^131072+1, discovered by Michael Angel in 2003. It has 628808 decimal digits. - Hugo Pfoertner, Jul 01 2003
For any n, a(n+1) >= sqrt(a(n)), because k^(2^(n+1))+1 = (k^2)^(2^n)+1. - Jeppe Stig Nielsen, Sep 16 2015
Does the sequence contain any perfect squares? If a(n) is a perfect square, then a(n+1) = sqrt(a(n)). - Jeppe Stig Nielsen, Sep 16 2015
If for a particular n, a(n) exists, then a(i) exist for all i=0,1,2,...,n. No proof is known that this sequence is infinite. Such a result would clearly imply the infinitude of A002496. - Jeppe Stig Nielsen, Sep 18 2015
919444 is a candidate for a(20). See Zimmermann link. -  Serge Batalov, Sep 02 2017
Now PrimeGrid has tested and double checked all b^(2^20) + 1 with b < 919444, so we have proof that a(20) = 919444. - Jeppe Stig Nielsen, Dec 30 2017

			The primes are 2^(2^0) + 1 = 3, 2^(2^1) + 1 = 5, 2^(2^2) + 1 = 17, 2^(2^3) + 1 = 257, 2^(2^4) + 1 = 65537, 30^(2^5) + 1, 102^(2^6) + 1, ....

Yves Gallot, Generalized Fermat Prime Search
Lucile and Yves Gallot, Generalized Fermat Prime Search
Michael Goetz, id=103235 of Top 5000 Primes
Luke Harmon, Gaetan Delavignette, Arnab Roy, and David Silva, PIE: p-adic Encoding for High-Precision Arithmetic in Homomorphic Encryption, Cryptology ePrint Archive 2023/700.
Stephen Scott, id=84401 of Top 5000 Primes
Sylvanus A. Zimmerman, PrimeGrid’s Generalized Fermat Prime Search

Cf. A006093, A005574, A000068, A006314, A006313, A006315, A006316, A056994, A056995, A057465, A057002, A088361, A088362, A226528, A226529, A226530, A251597, A253854, A244150, A243959, A321323.

Cf. A019434 (Fermat primes).

f[n_] := (p = 2^n; k = 2; While[cp = k^p + 1; !PrimeQ@cp, k++ ]; k); Do[ Print[{n, f@n}], {n, 0, 17}] (* Lei Zhou, Feb 21 2005 *)

a(n)=my(k=2);while(!isprime(k^(2^n)+1),k++);k \\ Anders Hellström, Sep 16 2015

a(n) = A085398(2^(n+1)). - Jianing Song, Jun 13 2022

from Robert G. Wilson v, Oct 30 2000
from Jeppe Stig Nielsen, Aug 07 2005
and 75898 from Lei Zhou, Feb 01 2012
919444 from Jeppe Stig Nielsen, Dec 30 2017

A006316 Numbers k such that k^64 + 1 is prime.

Original entry on oeis.org

1, 102, 162, 274, 300, 412, 562, 592, 728, 1084, 1094, 1108, 1120, 1200, 1558, 1566, 1630, 1804, 1876, 2094, 2162, 2164, 2238, 2336, 2388, 2420, 2494, 2524, 2614, 2784, 3024, 3104, 3140, 3164, 3254, 3278, 3628, 3694, 3738, 3750, 4000, 4030, 4058, 4166

Offset: 1

N. J. A. Sloane, Robert G. Wilson v

Harvey Dubner, Generalized Fermat primes, J. Recreational Math., 18 (1985): 279-280.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Simon Plouffe, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)

Cf. A005574, A000068, A006314, A006313, A006315, A056994, A056995, A057465, A057002, A088361, A088362, A226528, A226529, A226530, A251597, A253854, A244150, A243959, A321323.

[n: n in [1..4200] | IsPrime(n^64 + 1)]; // Vincenzo Librandi, Sep 25 2012

lst={};Do[If[PrimeQ[n^64+1], Print[n];AppendTo[lst, n]], {n, 10^4}];lst (* Vladimir Joseph Stephan Orlovsky, Aug 21 2008 *)
Select[Range[0, 4200], PrimeQ[(#^64 + 1)] &] (* Vincenzo Librandi, Sep 25 2012 *)

isA006316(n) = isprime(n^64+1) \\ Michael B. Porter, Mar 28 2010

More terms from Hugo Pfoertner, Jun 22 2003

A057002 Numbers n such that n^1024 + 1 is prime (a generalized Fermat prime).

Original entry on oeis.org

1, 824, 1476, 1632, 2462, 2484, 2520, 3064, 3402, 3820, 4026, 6640, 7026, 7158, 9070, 12202, 12548, 12994, 13042, 15358, 17646, 17670, 18336, 19564, 20624, 22500, 24126, 26132, 26188, 26240, 29074, 29658, 30778, 31126, 32244, 33044, 34016

Offset: 1

Robert G. Wilson v, Sep 09 2000

nonn

This sequence is infinite under Bunyakovsky's conjecture. - Charles R Greathouse IV, Apr 26 2012

T. D. Noe, Table of n, a(n) for n = 1..1000 (from Yves Gallot)
Yves Gallot, Generalized Fermat Prime Search
Jeppe Stig Nielsen, Generalized Fermat Primes sorted by base.
Eric Weisstein's World of Mathematics, Generalized Fermat Number

Other sequences of numbers n such that n^(2^k)+1 is prime for fixed k: A005574, A000068, A006314, A006313, A006315, A006316, A056994, A056995, A057465, A088361, A088362, A226528, A226529, A226530, A251597, A253854, A244150, A243959, A321323.

Cf. A006093.

Do[ k = 1; While[ PowerMod[ n, 1024, 2*k*1024 + 1 ] != 2*k*1024 && k < 2*10^6, k++ ]; If[ k == 2*10^6 && PrimeQ[ n^1024 + 1 ], Print[ n ] ], {n, 2, 13954, 2} ]
Do[If[PrimeQ[n^1024 + 1], Print[n], ## &[]], {n, 1, 100}] (* Includes first term and runs faster, Daniel Jolly, Nov 04 2014 *)

isA057002(n) = isprime(n^1024+1) \\ Michael B. Porter, Apr 03 2010

More terms from Jeppe Stig Nielsen, Sep 27 2003

Edited at the suggestion of T. D. Noe by N. J. A. Sloane, May 14 2008

cp's OEIS Frontend

A337607 Decimal expansion of Shanks's constant: the Hardy-Littlewood constant for A000068.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A005574 Numbers k such that k^2 + 1 is prime.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

PARI

Python

Formula

A006313 Numbers k such that k^16 + 1 is prime.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Extensions

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

Views

Author

Keywords

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A246392 Numbers n such that Phi(10, n) is prime, where Phi is the cyclotomic polynomial.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

A056994 Numbers k such that k^128 + 1 is prime.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

PARI

A006315 Numbers n such that n^32 + 1 is prime.

Views

Author