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