|
Search: id:A065073
|
|
|
| A065073 |
|
n-th prime + sum of digits of n-th prime. |
|
+0
2
|
|
| 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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
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} ]
|
|
PROGRAM
|
(PARI): digitsum(n) = local(s, d); s=0; while(n>0, d=divrem(n, 10); n=d[1]; s=s+d[2]); s a065073(m) = local(p); forprime(p=2, m, print1(p+digitsum(p), ", ")) a065073(300)
(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) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 05 2009]
|
|
CROSSREFS
|
Sequence in context: A088135 A137699 A144592 this_sequence A084997 A110507 A134624
Adjacent sequences: A065070 A065071 A065072 this_sequence A065074 A065075 A065076
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
Bodo Zinser (BodoZinser(AT)Compuserve.com), Nov 09 2001
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org) and Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 13 2001
|
|
|
Search completed in 0.002 seconds
|
