This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A210361 #6 Apr 06 2012 18:24:50
%S A210361 107,191,311,461,821,857,881,1301,1871,1997,2081,2237,2267,2657,3251,
%T A210361 3461,3671,4517,4967,5231,5477,5501,5651,6197,6827,7877,8087,8291,
%U A210361 8537,8861,9431,10427,10457,11171,12917,13001,13691,13757,13877,14081,14321,15641
%N A210361 Prime numbers p such that x^2 + x + p produces primes for x = 0..2 but not x = 3.
%C A210361 The first term is A164926(3).
%H A210361 T. D. Noe, <a href="/A210361/b210361.txt">Table of n, a(n) for n = 1..1000</a>
%t A210361 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 A210361 Cf. A067774, A164926, A210360, A210362, A210363, A210364, A210365.
%K A210361 nonn
%O A210361 1,1
%A A210361 _T. D. Noe_, Apr 05 2012