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 A103545 #13 Aug 10 2022 07:40:46
%S A103545 89,991,9949,99991,999961,9999991,99999989,999999491,9999999881,
%T A103545 99999999689,999999999989,9999999999161,99999999999481,
%U A103545 999999999999989,9999999999999641,99999999999999961,999999999999999989,9999999999999999961,99999999999999999989
%N A103545 Largest n-digit zeroless prime with nonprime digits.
%H A103545 Michael S. Branicky, <a href="/A103545/b103545.txt">Table of n, a(n) for n = 2..1000</a>
%t A103545 PrevPrim[n_] := Block[{k = n - 1}, While[ !PrimeQ[k], k-- ]; k]; f[n_] := Block[{pp = PrevPrim[ 10^n]}, While[ Union[ Join[{1, 4, 6, 8, 9}, IntegerDigits[pp]]] != {1, 4, 6, 8, 9}, pp = PrevPrim[pp]]; pp]; Table[ f[n], {n, 2, 18}] (* _Robert G. Wilson v_, Mar 26 2005 *)
%o A103545 (Python)
%o A103545 from sympy import isprime
%o A103545 from itertools import product
%o A103545 def a(n):
%o A103545 for p in product("98641", repeat=n):
%o A103545 t = int("".join(p))
%o A103545 if isprime(t): return t
%o A103545 print([a(n) for n in range(2, 22)]) # _Michael S. Branicky_, Aug 10 2022
%Y A103545 Cf. A103544.
%K A103545 base,nonn
%O A103545 2,1
%A A103545 _Ray G. Opao_, Mar 22 2005
%E A103545 More terms from _Jonathan Vos Post_, Mar 23 2005
%E A103545 a(7) to a(12) from _Jonathan Vos Post_, Mar 23 2005
%E A103545 a(13) to a(18) from _Robert G. Wilson v_, Mar 26 2005
%E A103545 a(19) and beyond from _Michael S. Branicky_, Aug 10 2022