|
|
A007605
|
|
Sum of digits of n-th prime.
(Formerly M0633)
|
|
90
|
|
|
2, 3, 5, 7, 2, 4, 8, 10, 5, 11, 4, 10, 5, 7, 11, 8, 14, 7, 13, 8, 10, 16, 11, 17, 16, 2, 4, 8, 10, 5, 10, 5, 11, 13, 14, 7, 13, 10, 14, 11, 17, 10, 11, 13, 17, 19, 4, 7, 11, 13, 8, 14, 7, 8, 14, 11, 17, 10, 16, 11, 13, 14, 10, 5, 7, 11, 7, 13, 14, 16, 11, 17, 16, 13, 19, 14, 20, 19, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
map(t -> convert(convert(t, base, 10), `+`), select(isprime, [2, (2*i+1 $ i=1..1000)])); # Robert Israel, Aug 16 2015
|
|
MATHEMATICA
|
Table[Apply[Plus, RealDigits[Prime[n]][[1]]], {n, 1, 100}]
Plus@@ IntegerDigits[Prime[Range[100]]] (* Zak Seidov *)
|
|
PROG
|
(Magma) [ &+Intseq(NthPrime(n), 10): n in [1..80] ]; // Klaus Brockhaus, Jun 13 2009]
(PARI) dsum(n)=my(s); while(n, s+=n%10; n\=10); s
(Haskell)
(Python)
from sympy import prime
def a(n): return sum(map(int, str(prime(n))))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|