|
Search: id:A091705
|
|
|
| A091705 |
|
Number of primes less than 10^n having at least one digit 4. |
|
+0
6
|
|
| 0, 3, 32, 326, 3231, 31953, 310456, 3000349, 28922364, 278508004, 2680391313, 25793058269
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(2) = 3 because of the 25 primes less than 10^2, 3 have at least one digit 4.
|
|
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], 4] != {}, c++ ]]; Print[c]; p--, {n, 1, 8}] (from Robert G. Wilson v Feb 02 2004)
|
|
CROSSREFS
|
a(n) + A091638(n) = A006880(n).
Cf. A091744, A091745, A091746, A091747, A091706, A091707, A091708, A091709, A091710.
Adjacent sequences: A091702 A091703 A091704 this_sequence A091706 A091707 A091708
Sequence in context: A037673 A037799 A091706 this_sequence A137215 A123336 A058479
|
|
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
3 more terms from Ryan Propper (rpropper(AT)stanford.edu), Aug 21 2005
|
|
|
Search completed in 0.002 seconds
|
