A065995 a(n) = prime(prime(n) + n).

5, 11, 19, 31, 53, 67, 89, 103, 131, 167, 181, 227, 251, 269, 293, 347, 383, 401, 443, 467, 491, 547, 577, 617, 673, 709, 733, 761, 787, 823, 929, 967, 1013, 1031, 1097, 1117, 1181, 1229, 1277, 1303, 1373, 1409, 1481, 1489, 1531, 1553, 1627, 1741, 1783

Offset: 1

Author

Reinhard Zumkeller, Dec 10 2001

Keywords

• nonn

References

• 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).

Links

• N. J. A. Sloane, Table of n, a(n) for n = 1..20000 [First 1000 terms from Harry J. Smith]
• David A. Corneth, PARI program

Crossrefs

Cf. A000040, A014688.

Programs

Maple

p:=ithprime; f:=n->p(p(n)+n); [seq(f(n),n=1..1000)]; # N. J. A. Sloane, Apr 16 2015

Mathematica

Table[Prime[n+ Prime[n]], {n, 100}] (* Waldemar Puszkarz, Jan 24 2015 *)

PARI

a(n) = prime(prime(n) + n); \\ Harry J. Smith, Nov 06 2009

PARI

\\ See PARI link

Formula

a(n) = A000040(A014688(n)). - Omar E. Pol, Oct 22 2013