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 A267421 #32 Jan 08 2017 15:56:34
%S A267421 17,41,73,113,139,163,193,223,491,859,919,1187,1259,1409,1483,1901,
%T A267421 1987,2083,2267,2467,2677,3221,4339,4603,5923,6079,7573,8839,9421,
%U A267421 9619,10223,11489,11701,12143,12589,13499,13729,14449,15679,16183,16703,17231,17497,19121
%N A267421 Primes of the form prime(n) + n + n^2.
%H A267421 Robert Israel, <a href="/A267421/b267421.txt">Table of n, a(n) for n = 1..10000</a>
%e A267421 The ninth prime is 23, and 23 + 9 + 9^2 = 113, which is prime, so 113 is in the sequence.
%p A267421 p:= 0: Res:= NULL:
%p A267421 for n from 1 to 1000 do
%p A267421 p:= nextprime(p);
%p A267421 if isprime(p+n+n^2) then Res:= Res, p+n+n^2 fi
%p A267421 od:
%p A267421 Res; # _Robert Israel_, Jan 08 2017
%t A267421 Select[Table[Prime[n] + n + n^2, {n, 100}], PrimeQ] (* _Alonso del Arte_, Feb 22 2016 *)
%o A267421 (PARI) lista(nn) = {for (n=1, nn, if (isprime(p=prime(n)+n+n^2), print1(p, ", ")););} \\ _Michel Marcus_, Mar 13 2016
%Y A267421 Cf. A014688, A128938.
%K A267421 nonn,easy
%O A267421 1,1
%A A267421 _Emre APARI_, Jan 14 2016
%E A267421 More terms from _Michel Marcus_, Mar 13 2016