The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A097952 Sum of the number of digits in the prime numbers less than 10^n. 12
 0, 4, 46, 475, 4719, 46534, 459970, 4562537, 45337545, 451112256, 4493162026, 44786187348, 446664473808, 4456613596481, 44480880591963, 444075310669968, 4434375640450064, 44287795522995300, 442382943864554586 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Partial sums of A046719(n) = n*A006879(n). In other words, a(n)is the number of digits used in writing out all {A006880(n)} primes below 10^n. - Lekraj Beedassy, Dec 13 2007 Partial sums of A046719(n) = n*A006879(n). In other words, a(n)is the number of digits used in writing out all {A006880(n)} primes below 10^n. - Lekraj Beedassy, Dec 14 2007 LINKS EXAMPLE There are 25 primes < 100. 4 of them are 1 digit numbers and 21 are 2 digit numbers. Thus 4+21*2 = 46, the third entry in the table. MATHEMATICA Accumulate[Table[n(PrimePi[10^n]-PrimePi[10^(n-1)]), {n, 0, 14}]] (* This generates the first 15 terms of the sequence, but if n exceeds 14 the function PrimePi in Mathematica cannot calculate it. *) (* Harvey P. Dale, Jun 13 2014 *) PROG (PARI) g(n) = for(j=0, n, s=0; forprime(x=2, 10^j, y=length(Str(x)); s+=y); print1(s", ")) CROSSREFS Cf. A119290. Sequence in context: A231787 A173716 A320229 * A097643 A155652 A222098 Adjacent sequences:  A097949 A097950 A097951 * A097953 A097954 A097955 KEYWORD nonn,base AUTHOR Cino Hilliard, Sep 05 2004 EXTENSIONS More terms derived from A006879 - R. J. Mathar, Oct 14 2010 STATUS approved

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

Last modified January 24 10:24 EST 2020. Contains 331193 sequences. (Running on oeis4.)