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.

A064711 Numbers n such that n^2 + prime(n) is a prime.

This page as a plain text file.
%I A064711 #18 Sep 08 2022 08:45:04
%S A064711 1,2,4,8,12,14,22,30,36,38,44,50,54,60,66,74,78,84,90,96,106,134,144,
%T A064711 156,162,168,180,188,216,222,224,234,260,264,272,308,324,336,344,366,
%U A064711 368,374,378,390,402,406,422,466,468,476,492,498,502,516,604,624,636
%N A064711 Numbers n such that n^2 + prime(n) is a prime.
%H A064711 Harry J. Smith, <a href="/A064711/b064711.txt">Table of n, a(n) for n=1..1000</a>
%e A064711 2 is in the sequence because 2^2 + Prime(2) = 4 + 3 = 7 is a prime.
%t A064711 Select[ Range[ 1000 ], PrimeQ[ #^2 + Prime[ # ] ] & ]
%o A064711 (PARI) { n=0; for (m=1, 10^9, if (isprime(m^2 + prime(m)), write("b064711.txt", n++, " ", m); if (n==1000, break)) ) } \\ _Harry J. Smith_, Sep 23 2009
%o A064711 (Magma) [ n: n in [1..700] | IsPrime(n^2+NthPrime(n)) ]; // _Klaus Brockhaus_, Apr 12 2011
%Y A064711 Cf. A004232, A184935.
%K A064711 easy,nonn
%O A064711 1,2
%A A064711 _Robert G. Wilson v_, Oct 13 2001