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 A210363 #12 May 29 2025 16:05:41
%S A210363 347,641,1427,2687,4001,4637,4931,19421,21011,22271,23741,26711,27941,
%T A210363 32057,43781,45821,55331,55817,68207,71327,91571,128657,165701,167621,
%U A210363 172421,179897,191447,193871,205421,234191,239231,258107,258611,259157,278807,290021
%N A210363 Prime numbers p such that x^2 + x + p produces primes for x = 0..4 but not x = 5.
%C A210363 The first term is A164926(5).
%H A210363 T. D. Noe, <a href="/A210363/b210363.txt">Table of n, a(n) for n = 1..1000</a>
%t A210363 lookfor = 5; 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
%t A210363 Select[Prime[Range[26000]],AllTrue[#+{2,6,12,20},PrimeQ] && !PrimeQ[ #+30]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* _Harvey P. Dale_, Mar 13 2017 *)
%t A210363 Select[Prime[Range[26000]],Boole[PrimeQ[#+{2,6,12,20,30}]]=={1,1,1,1,0}&] (* _Harvey P. Dale_, May 29 2025 *)
%Y A210363 Cf. A067774, A164926, A210360, A210361, A210362, A210364, A210365.
%K A210363 nonn
%O A210363 1,1
%A A210363 _T. D. Noe_, Apr 05 2012