cp's OEIS Frontend

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.

A267421 Primes of the form prime(n) + n + n^2.

Original entry on oeis.org

17, 41, 73, 113, 139, 163, 193, 223, 491, 859, 919, 1187, 1259, 1409, 1483, 1901, 1987, 2083, 2267, 2467, 2677, 3221, 4339, 4603, 5923, 6079, 7573, 8839, 9421, 9619, 10223, 11489, 11701, 12143, 12589, 13499, 13729, 14449, 15679, 16183, 16703, 17231, 17497, 19121
Offset: 1

Views

Author

Emre APARI, Jan 14 2016

Keywords

Examples

			The ninth prime is 23, and 23 + 9 + 9^2 = 113, which is prime, so 113 is in the sequence.
		

Crossrefs

Programs

  • Maple
    p:= 0: Res:= NULL:
    for n from 1 to 1000 do
      p:= nextprime(p);
      if isprime(p+n+n^2) then Res:= Res, p+n+n^2 fi
    od:
    Res; # Robert Israel, Jan 08 2017
  • Mathematica
    Select[Table[Prime[n] + n + n^2, {n, 100}], PrimeQ] (* Alonso del Arte, Feb 22 2016 *)
  • PARI
    lista(nn) = {for (n=1, nn, if (isprime(p=prime(n)+n+n^2), print1(p, ", ")););} \\ Michel Marcus, Mar 13 2016

Extensions

More terms from Michel Marcus, Mar 13 2016