The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #28 Mar 23 2021 15:49:56
%S 3,22,139,877,6235,46105,352155,2747284,21831323,175881412,1432781905,
%T 11778245565,97558533214,813253056497
%N Number of primes less than 10^n which do not contain the digit 2.
%C Number of primes less than 10^n after removing any primes with at least one digit 2.
%F a(n) = A006880(n) - A091646(n).
%e a(2) = 22 because of the 25 primes less than 10^2, 3 have at least one digit 2. 25-3 = 22.
%t 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 *)
%o (Python)
%o from sympy import primerange
%o def a(n): return sum('2' not in str(p) for p in primerange(2, 10**n))
%o print([a(n) for n in range(1, 7)]) # _Michael S. Branicky_, Mar 22 2021
%Y Cf. A091634, A091635, A091637, A091638, A091639, A091640, A091641, A091642, A091643, A091646.
%Y Cf. A006880, A091646.
%K more,nonn,base
%O 1,1
%A _Enoch Haga_, Jan 30 2004
%E Edited and extended by _Robert G. Wilson v_, Feb 02 2004
%E a(9)-a(12) from _Donovan Johnson_, Feb 14 2008
%E a(13) from _Robert Price_, Nov 08 2013
%E a(14) from _Giovanni Resta_, Mar 20 2017