A119290 a(n) is the total number of digits in the first 10^n primes.

1, 16, 271, 3803, 48982, 610484, 7245905, 83484450, 942636916, 10487584405, 115369529592, 1257761617574, 13611696080735, 146406754329933, 1566562183907264, 16687323842873339, 177063766685219106, 1872323812397478246, 19738266145121133639, 207517446542560214799, 2176390177056541482871, 22774922890367225576581

Offset

0,2

Links

Table of n, a(n) for n=0..21.

Formula

Count the digits in the first 10^n primes.

a(n) = sum while positive from k=0 (10^n - A006880(k)). - Charles R Greathouse IV, Jul 09 2007

Example

At a(1) there are 10^1 primes, 2 3 5 7 11 13 17 19 23 29, and the total number of digits is 16.

Mathematica

Accumulate@Table[c = 0; i0 = If[n == 0, 1, 10^(n - 1) + 1]; For[i = i0, i <= 10^n, i++, c += IntegerLength[Prime[i]]]; c, {n, 0, 6}] (* Robert Price, Jun 09 2019 *)

Crossrefs

Cf. A097952.

Sequence in context: A220757 A166908 A221089 * A161595 A144660 A158574

Adjacent sequences: A119287 A119288 A119289 * A119291 A119292 A119293

Keyword

easy,nonn,base

Author

Enoch Haga, May 13 2006

Extensions

Corrected and extended by Charles R Greathouse IV, Jul 09 2007

Status

approved