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.

A064712 Numbers k such that k^2 - prime(k) is a prime.

This page as a plain text file.
%I A064712 #29 Jun 02 2023 01:11:43
%S A064712 6,10,12,18,24,28,30,40,42,48,60,76,96,104,108,114,138,146,160,166,
%T A064712 174,176,186,190,196,198,208,230,250,258,262,270,292,296,318,320,334,
%U A064712 336,348,356,358,362,370,372,376,382,400,420,444,454,462,472,488,494,504
%N A064712 Numbers k such that k^2 - prime(k) is a prime.
%C A064712 A073497(a(n)) is a prime. - _Zak Seidov_, Apr 11 2011
%H A064712 Harry J. Smith, <a href="/A064712/b064712.txt">Table of n, a(n) for n = 1..1000</a>
%e A064712 6 is in the sequence because 6^2 - prime(6) = 36 - 13 = 23 is a prime.
%t A064712 Select[ Range[ 6,1000,2 ], PrimeQ[ #^2 - Prime[ # ] ] & ]
%o A064712 (PARI) n=0; forstep (m=6, 10^9, 2, if (isprime(m^2 - prime(m)), write("b064712.txt", n++, " ", m); if (n==1000, break)) ) \\ _Harry J. Smith_, Sep 23 2009
%o A064712 (Magma) [n: n in [6..1000] | IsPrime(n^2-NthPrime(n))]; // _Vincenzo Librandi_, Apr 14 2011
%K A064712 easy,nonn
%O A064712 1,1
%A A064712 _Robert G. Wilson v_, Oct 13 2001