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 A064713 #15 Nov 17 2022 19:15:26
%S A064713 1,2,6,8,20,30,42,48,50,60,68,96,110,122,132,168,204,222,234,284,306,
%T A064713 332,336,366,378,392,398,402,420,440,474,488,492,506,516,518,530,572,
%U A064713 594,600,650,672,680,740,756,762,770,810,870,884,888,902,920,930,938
%N A064713 Numbers k such that prime(k)^2 - k is prime.
%H A064713 Harry J. Smith, <a href="/A064713/b064713.txt">Table of n, a(n) for n = 1..1000</a>
%e A064713 6 is in the sequence because prime(6)^2 - 6 = 169 - 6 = 163 is a prime.
%p A064713 A064713:=n->`if`(isprime(ithprime(n)^2-n), n, NULL): seq(A064713(n), n=1..2*10^3); # _Wesley Ivan Hurt_, Jan 21 2017
%t A064713 Select[Range[1000],PrimeQ[Prime[#]^2-#]&] (* _Harvey P. Dale_, May 17 2013 *)
%o A064713 (PARI) { n=0; for (m=1, 10^9, if (isprime(prime(m)^2 - m), write("b064713.txt", n++, " ", m); if (n==1000, break)) ) } \\ _Harry J. Smith_, Sep 23 2009
%Y A064713 Cf. A064361.
%K A064713 easy,nonn
%O A064713 1,2
%A A064713 _Robert G. Wilson v_, Oct 13 2001