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 A091641 #19 Mar 17 2021 02:52:57
%S A091641 3,16,100,680,4773,34992,266823,2079512,16503238,132852644,1081509855,
%T A091641 8885472675,73563855306,612982476612
%N A091641 Number of primes less than 10^n which do not contain the digit 7.
%C A091641 Number of primes less than 10^n after removing any primes with at least one digit 7.
%F A091641 a(n) = A006880(n) - A091708(n).
%e A091641 a(2) = 16 because of the 25 primes less than 10^2, 9 have at least one digit 7; 25-9=16.
%t A091641 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], 7] == {}, c++ ]]; Print[c]; p--, {n, 1, 8}] (* _Robert G. Wilson v_, Feb 02 2004 *)
%o A091641 (Python)
%o A091641 from sympy import primerange
%o A091641 def a(n): return sum('7' not in str(p) for p in primerange(2, 10**n))
%o A091641 print([a(n) for n in range(1, 7)]) # _Michael S. Branicky_, Mar 16 2021
%Y A091641 Cf. A091634, A091635, A091636, A091637, A091638, A091639, A091640, A091642, A091643.
%K A091641 more,nonn,base
%O A091641 1,1
%A A091641 _Enoch Haga_, Jan 30 2004
%E A091641 Edited and extended by _Robert G. Wilson v_, Feb 02 2004
%E A091641 a(9)-a(12) from _Donovan Johnson_, Feb 14 2008
%E A091641 a(13) from _Robert Price_, Nov 08 2013
%E A091641 a(14) from _Giovanni Resta_, Mar 20 2017