A211238 Prime numbers p such that x^2 + x + p produces primes for x = 0..9 but not x = 10.

11, 844427, 51448361, 86966771, 122983031, 960959381, 2426256797, 2911675511, 3013107257, 4778888351, 5221343711, 5258591537, 6430890287, 7156316591, 8518049207, 8828280941, 9467776751, 10687380227, 10783636931, 11856793337, 12128287007, 14431067237, 14772642497

Offset: 1

Author

T. D. Noe, Apr 08 2012

Keywords

• nonn

Comments

The first term is A164926(10).

Links

• Zak Seidov, Table of n, a(n) for n = 1..133

Crossrefs

Cf. A067774, A164926.

Programs

Mathematica

lookfor = 10; t = {}; n = 0; While[Length[t] < 25, n++; c = Prime[n]; i = 1; While[PrimeQ[i^2 + i + c], i++]; If[i == lookfor, AppendTo[t, c]]]; t