|
Search: id:A097952
|
|
|
| A097952 |
|
Sum of the number of digits in the prime numbers less than 10^n. |
|
+0
1
|
|
| 0, 4, 46, 475, 4719, 46534, 459970, 4562537, 45337545, 451112256
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
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 (boodhiman(AT)yahoo.com), 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 (blekraj(AT)yahoo.com), Dec 14 2007
|
|
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.
|
|
PROGRAM
|
(PARI) g(n) = for(j=0, n, s=0; forprime(x=2, 10^j, y=length(Str(x)); s+=y); print1(s", "))
|
|
CROSSREFS
|
Adjacent sequences: A097949 A097950 A097951 this_sequence A097953 A097954 A097955
Sequence in context: A119046 A131540 A132932 this_sequence A097643 A113264 A126739
|
|
KEYWORD
|
more,nonn,base
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Sep 05 2004
|
|
|
Search completed in 0.002 seconds
|
