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 A091639 #21 Mar 23 2021 01:13:16
%S A091639 3,22,136,905,6310,46549,354910,2765749,21955845,176781643,1439380189,
%T A091639 11827571824,97933795005,816144146010
%N A091639 Number of primes less than 10^n which do not contain the digit 5.
%C A091639 Number of primes less than 10^n after removing any primes with at least one digit 5.
%F A091639 a(n) = A006880(n) - A091706(n).
%e A091639 a(2) = 22 because of the 25 primes less than 10^2, 3 have at least one digit 5; 25-3 = 22.
%t A091639 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], 5] == {}, c++ ]]; Print[c]; p--, {n, 1, 8}] (* _Robert G. Wilson v_, Feb 02 2004 *)
%o A091639 (Python)
%o A091639 from sympy import primerange
%o A091639 def a(n): return sum('5' not in str(p) for p in primerange(2, 10**n))
%o A091639 print([a(n) for n in range(1, 7)]) # _Michael S. Branicky_, Mar 22 2021
%Y A091639 Cf. A091634, A091635, A091636, A091637, A091638, A091640, A091641, A091642, A091643.
%Y A091639 Cf. A006880, A091706.
%K A091639 more,nonn,base
%O A091639 1,1
%A A091639 _Enoch Haga_, Jan 30 2004
%E A091639 Edited and extended by _Robert G. Wilson v_, Feb 02 2004
%E A091639 a(9)-a(12) from _Donovan Johnson_, Feb 14 2008
%E A091639 a(13) from _Robert Price_, Nov 08 2013
%E A091639 a(14) from _Giovanni Resta_, Mar 20 2017