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 A065059 #11 Jun 18 2018 03:34:38
%S A065059 3,13,53,71,113,181,397,463,479,557,593,647,683,701,719,743,769,863,
%T A065059 941,983,1069,1091,1109,1181,1193,1231,1277,1291,1307,1451,1733,1811,
%U A065059 1931,2347,2393,2411,2473,2531,2551,2593,2887,3041,3221,3251,3347,3361
%N A065059 Primes p such that prime(p) + pi(p) is a prime.
%H A065059 Harry J. Smith, <a href="/A065059/b065059.txt">Table of n, a(n) for n = 1..1000</a>
%t A065059 Select[Prime[Range[500]],PrimeQ[Prime[#]+PrimePi[#]]&] (* _Harvey P. Dale_, Oct 12 2014 *)
%o A065059 (PARI) { n=0; default(primelimit, 4294965247); for (m=1, 10^9, p=prime(m); if (isprime(prime(p) + primepi(p)), write("b065059.txt", n++, " ", p); if (n==1000, return)) ) } \\ _Harry J. Smith_, Oct 05 2009
%Y A065059 Cf. A065042.
%K A065059 easy,nonn
%O A065059 1,1
%A A065059 _Robert G. Wilson v_, Nov 06 2001