|
|
A065073
|
|
n-th prime + sum of digits of n-th prime.
|
|
5
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(5) = 13 because p(5) = 11 and 11 + (1 + 1) = 13.
|
|
MATHEMATICA
|
Table[ Prime[n] + Apply[ Plus, IntegerDigits[ Prime[n]]], {n, 1, 75} ]
|
|
PROG
|
(PARI) forprime(p=2, 300, print1(p+sumdigits(p), ", ")) \\ Edited by M. F. Hasler, Nov 06 2018
(PARI) SumD(x)={local(s); s=0; while (x>9, s+=x-10*(x\10); x\=10); return(s + x)}
{ for (n=1, 1000, a=prime(n); a+=SumD(a); write("b065073.txt", n, " ", a)) } \\ Harry J. Smith, Oct 05 2009
(Magma) [NthPrime(n) + &+Intseq(NthPrime(n), 10): n in [1..80]]; // Vincenzo Librandi, Nov 07 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|