The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #6 Apr 06 2012 18:24:50
%S 107,191,311,461,821,857,881,1301,1871,1997,2081,2237,2267,2657,3251,
%T 3461,3671,4517,4967,5231,5477,5501,5651,6197,6827,7877,8087,8291,
%U 8537,8861,9431,10427,10457,11171,12917,13001,13691,13757,13877,14081,14321,15641
%N Prime numbers p such that x^2 + x + p produces primes for x = 0..2 but not x = 3.
%C The first term is A164926(3).
%H T. D. Noe, <a href="/A210361/b210361.txt">Table of n, a(n) for n = 1..1000</a>
%t 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
%Y Cf. A067774, A164926, A210360, A210362, A210363, A210364, A210365.
%K nonn
%O 1,1
%A _T. D. Noe_, Apr 05 2012