A065073 a(n) = prime(n) + (sum of digits of prime(n)).

4, 6, 10, 14, 13, 17, 25, 29, 28, 40, 35, 47, 46, 50, 58, 61, 73, 68, 80, 79, 83, 95, 94, 106, 113, 103, 107, 115, 119, 118, 137, 136, 148, 152, 163, 158, 170, 173, 181, 184, 196, 191, 202, 206, 214, 218, 215, 230, 238, 242, 241, 253, 248, 259, 271, 274, 286

Offset: 1

Author

Bodo Zinser, Nov 09 2001

Keywords

• nonn
• base
• easy

Examples

			a(5) = 13 because p(5) = 11 and 11 + (1 + 1) = 13.
		

Links

• Harry J. Smith, Table of n, a(n) for n = 1..1000

Crossrefs

Cf. A062028, A007953, A000040.

Cf. A047791, A048519, A048520, A006378, A107740.

Programs

Haskell

a065073 = a062028 . a000040  -- Reinhard Zumkeller, Sep 27 2014

Magma

[NthPrime(n) + &+Intseq(NthPrime(n), 10): n in [1..80]]; // Vincenzo Librandi, Nov 07 2018

Mathematica

Table[ Prime[n] + Apply[ Plus, IntegerDigits[ Prime[n]]], {n, 1, 75} ]

PARI

forprime(p=2,300,print1(p+sumdigits(p),",")) \\ Edited by M. F. Hasler, Nov 06 2018

PARI

A065073(n)=sumdigits(n=prime(n))+n \\ M. F. Hasler, Nov 06 2018

Formula

a(n) = A062028(A000040(n)). - M. F. Hasler, Nov 06 2018

Extensions

More terms from Larry Reeves (larryr(AT)acm.org) and Robert G. Wilson v, Nov 13 2001