A210361 Prime numbers p such that x^2 + x + p produces primes for x = 0..2 but not x = 3.

107, 191, 311, 461, 821, 857, 881, 1301, 1871, 1997, 2081, 2237, 2267, 2657, 3251, 3461, 3671, 4517, 4967, 5231, 5477, 5501, 5651, 6197, 6827, 7877, 8087, 8291, 8537, 8861, 9431, 10427, 10457, 11171, 12917, 13001, 13691, 13757, 13877, 14081, 14321, 15641

Offset

1,1

Comments

The first term is A164926(3).

Links

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

Mathematica

lookfor = 3; 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

Cf. A067774, A164926, A210360, A210362, A210363, A210364, A210365.

Sequence in context: A107215 A142142 A265915 * A250147 A142270 A044339

Adjacent sequences: A210358 A210359 A210360 * A210362 A210363 A210364

Keyword

nonn

Author

T. D. Noe, Apr 05 2012

Status

approved