OFFSET
1,1
COMMENTS
Number of primes less than 10^n after removing any primes with at least one digit 2.
EXAMPLE
a(2) = 22 because of the 25 primes less than 10^2, 3 have at least one digit 2. 25-3 = 22.
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], 2] == {}, c++ ]]; Print[c]; p--, {n, 1, 8}] (* Robert G. Wilson v, Feb 02 2004 *)
PROG
(Python)
from sympy import primerange
def a(n): return sum('2' not in str(p) for p in primerange(2, 10**n))
print([a(n) for n in range(1, 7)]) # Michael S. Branicky, Mar 22 2021
CROSSREFS
KEYWORD
more,nonn,base
AUTHOR
Enoch Haga, Jan 30 2004
EXTENSIONS
Edited and extended by Robert G. Wilson v, Feb 02 2004
a(9)-a(12) from Donovan Johnson, Feb 14 2008
a(13) from Robert Price, Nov 08 2013
a(14) from Giovanni Resta, Mar 20 2017
STATUS
approved