|
| |
|
|
A073517
|
|
Number of primes less than 10^n with initial digit 1.
|
|
13
| |
|
|
0, 4, 25, 160, 1193, 9585, 80020, 686048, 6003530, 53378283, 480532488, 4369582734, 40063566855, 369893939287, 3435376839800, 32069022099022, 300694113015105, 2830466318006780, 26735673312004455, 253315661161665338
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
LINKS
| Chris K. Caldwell, How Many Primes Are There?
Xavier Gourdan & Pascal Sebah, Counting the number of primes [sic]
Henri Lifchitz, Parity of Pi(n)
Thomas R. Nicely, Some Results of Computational Research in Prime Numbers
|
|
|
EXAMPLE
| a(2)=4 because there are 4 primes up to 10^2 whose initial digit is 1 (11, 13, 17 and 19).
|
|
|
MATHEMATICA
| f[n_] := f[n] = PrimePi[2*10^n] - PrimePi[10^n] + f[n - 1]; f[0] = 0; Table[ f[n], {n, 0, 13}]
|
|
|
CROSSREFS
| Cf. A073509 to A073517, their sum is A006880.
Sequence in context: A010909 A079750 A195510 * A184755 A074422 A128419
Adjacent sequences: A073514 A073515 A073516 * A073518 A073519 A073520
|
|
|
KEYWORD
| base,hard,nonn
|
|
|
AUTHOR
| Shyam Sunder Gupta (guptass(AT)rediffmail.com), Aug 14 2002
|
|
|
EXTENSIONS
| Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 29 2002
|
| |
|
|
