|
Search: id:A091644
|
|
|
| A091644 |
|
Number of primes less than 10^n which have at least one digit 0. |
|
+0
2
|
|
| 0, 0, 15, 219, 2470, 26185, 266713, 2658107, 26198216, 256516296, 2501246232, 24320647270
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
3 additional terms, generated using a sieve program. - Ryan Propper (rpropper(AT)stanford.edu), Aug 20 2005
|
|
EXAMPLE
|
a(3) = 15 because of the 168 primes less than 10^3, 15 have at least one 0 digit.
|
|
MATHEMATICA
|
NextPrim[n_] := Block[{k = n + 1}, While[ ! PrimeQ[k], k++ ]; k]; c = 0; p = 1; Do[ While[ p = NextPrim[p]; p < 10^n, If[ Position[ IntegerDigits[p], 0] != {}, c++ ]]; Print[c]; p--, {n, 1, 8}] (from Robert G. Wilson v Feb 02 2004)
|
|
CROSSREFS
|
a(n) + A091634(n) = A006880(n).
Cf. A091645, A091646, A091647, A091705, A091706, A091707, A091708, A091709, A091710.
Sequence in context: A051826 A081196 A020287 this_sequence A027843 A027840 A057500
Adjacent sequences: A091641 A091642 A091643 this_sequence A091645 A091646 A091647
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Jan 30 2004
|
|
EXTENSIONS
|
Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 02 2004
More terms from Ryan Propper (rpropper(AT)stanford.edu), Aug 20 2005
|
|
|
Search completed in 0.002 seconds
|
