|
|
A210364
|
|
Prime numbers p such that x^2 + x + p produces primes for x = 0..5 but not x = 6.
|
|
7
|
|
|
1607, 3527, 13901, 31247, 33617, 55661, 68897, 97367, 166841, 195731, 221717, 347981, 348431, 354371, 416387, 506327, 548831, 566537, 929057, 954257, 1246367, 1265081, 1358801, 1505087, 1538081, 1595051, 1634441, 1749257, 2200811, 2322107, 2641547, 2697971
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
lookfor = 6; t = {}; n = 0; While[Length[t] < 50, n++; c = Prime[n]; i = 1; While[PrimeQ[i^2 + i + c], i++]; If[i == lookfor, AppendTo[t, c]]]; t
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|