|
|
A210360
|
|
Prime numbers p such that x^2 + x + p produces primes for x = 0..1 but not x = 2.
|
|
8
|
|
|
3, 29, 59, 71, 137, 149, 179, 197, 239, 269, 281, 419, 431, 521, 569, 599, 617, 659, 809, 827, 1019, 1031, 1049, 1061, 1151, 1229, 1289, 1319, 1451, 1619, 1667, 1697, 1721, 1787, 1877, 1931, 1949, 2027, 2087, 2111, 2129, 2141, 2309, 2339, 2381, 2549, 2591
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
lookfor = 2; 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
|
|
|
|