A058196 - OEIS

%I #7 Jun 03 2024 03:47:23

%S 2,57,1111,17024,224155,2674957,31352962,363506969,4127383480,

%T 45630284509,502160313778

%N Sum of digits of first 10^n primes.

%t NextPrime[ n_Integer ] := Module[ {k}, k = n + 1; While[ ! PrimeQ[ k ], k++ ]; k ]; c = d = p = q = 0; Do[ While[ d++; d <= 10^n, q = NextPrime[ q ]; p = p + Apply[ Plus, RealDigits[ q ][ [ 1 ] ] ]; If[ PrimeQ[ p ], c++ ] ]; d--; Print[ p ], {n, 0, 10}

%o (PARI) a(n) = {my(k = 0, s = 0, pow = 10^n); forprime(p = 2, , k++; s += sumdigits(p); if(k == pow, break)); s;} \\ _Amiram Eldar_, Jun 03 2024

%Y Cf. A051351, A057573.

%K nonn,base,more

%O 0,1

%A _Robert G. Wilson v_, Nov 27 2000

%E a(9)-a(10) from _Amiram Eldar_, Jun 03 2024