|
|
A210365
|
|
Prime numbers p such that x^2 + x + p produces primes for x = 0..6 but not x = 7.
|
|
7
|
|
|
1277, 28277, 113147, 421697, 665111, 1164587, 1615631, 2798921, 2846771, 3053747, 5071667, 5093507, 5344247, 5706641, 6383051, 8396777, 10732817, 10812407, 11920367, 13176587, 16197947, 16462541, 16655447, 16943471, 17807831, 18102101, 20488901, 23421311
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
lookfor = 7; t = {}; n = 0; While[Length[t] < 30, 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
|
|
|
|