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 A065995 #68 Dec 17 2023 10:25:55
%S A065995 5,11,19,31,53,67,89,103,131,167,181,227,251,269,293,347,383,401,443,
%T A065995 467,491,547,577,617,673,709,733,761,787,823,929,967,1013,1031,1097,
%U A065995 1117,1181,1229,1277,1303,1373,1409,1481,1489,1531,1553,1627,1741,1783
%N A065995 a(n) = prime(prime(n) + n).
%D A065995 Popular Computing (Calabasas, CA), A Function Of Primes, Problem 206, Vol. 5 (No. 55, Oct 1977), page PC55-19. Asks for rate of growth of a(n).
%H A065995 N. J. A. Sloane, <a href="/A065995/b065995.txt">Table of n, a(n) for n = 1..20000</a> [First 1000 terms from Harry J. Smith]
%H A065995 David A. Corneth, <a href="/A065995/a065995.gp.txt">PARI program</a>
%F A065995 a(n) = A000040(A014688(n)). - _Omar E. Pol_, Oct 22 2013
%p A065995 p:=ithprime; f:=n->p(p(n)+n); [seq(f(n),n=1..1000)]; # _N. J. A. Sloane_, Apr 16 2015
%t A065995 Table[Prime[n+ Prime[n]], {n, 100}] (* _Waldemar Puszkarz_, Jan 24 2015 *)
%o A065995 (PARI) a(n) = prime(prime(n) + n); \\ _Harry J. Smith_, Nov 06 2009
%o A065995 (PARI) \\ See PARI link
%Y A065995 Cf. A000040, A014688.
%K A065995 nonn
%O A065995 1,1
%A A065995 _Reinhard Zumkeller_, Dec 10 2001