login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051351 a(n) = a(n-1) + sum of digits of n-th prime. 17

%I #6 Aug 28 2023 14:34:22

%S 0,2,5,10,17,19,23,31,41,46,57,61,71,76,83,94,102,116,123,136,144,154,

%T 170,181,198,214,216,220,228,238,243,253,258,269,282,296,303,316,326,

%U 340,351,368,378,389,402,419,438,442,449,460,473,481,495,502,510,524

%N a(n) = a(n-1) + sum of digits of n-th prime.

%t Table[ Sum[ Apply[ Plus, RealDigits[ Prime[ j ]] [[1]] ], {j, 1, n} ], {n, 1, 100} ]

%o (PARI) a(n) = vecsum(apply(sumdigits, primes(n))); \\ _Michel Marcus_, Aug 28 2023

%Y Cf. A007605.

%K nonn,easy,base

%O 0,2

%A Armand Turpel (armandt(AT)unforgettable.com)

%E More terms from _Robert G. Wilson v_, Nov 18 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 06:45 EDT 2024. Contains 371906 sequences. (Running on oeis4.)