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 A036337 #32 Sep 02 2022 13:17:42
%S A036337 7,95,994,9999,99996,999992,9999968,99999840,999999968,9999999900,
%T A036337 99999999840,999999999744,9999999998720,99999999998400,
%U A036337 999999999999000,9999999999999744,99999999999995904,999999999999967232,9999999999999989760,99999999999999995904
%N A036337 Largest integer with n digits and exactly n prime factors (counted with multiplicity).
%C A036337 If all prime factors are distinct then a(n) >= A002110(n) which might give a contradiction for large enough n and so some primes have a multiplicity > k for some nonnegative k. - _David A. Corneth_, Oct 30 2018
%H A036337 Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_025.htm">Puzzle 25. Composed primes (by G.L. Honaker, Jr.)</a>, The Prime Puzzles and Problems Connection. (A related puzzle.)
%e A036337 95 = 5 * 19, while 96, 97, 98, 99 and 100 have, respectively, 6,1,3,3 and 4 prime factors; thus 95 is the largest two digit number with exactly two prime factors.
%t A036337 Table[Module[{k=10^n-1},While[PrimeOmega[k]!=n,k--];k],{n,20}] (* _Harvey P. Dale_, Sep 02 2022 *)
%o A036337 (PARI) a(n) = forstep(i = 10^n-1,10^(n-1),-1,if(bigomega(i) == n, return(i))) \\ _David A. Corneth_, Oct 30 2018
%Y A036337 Cf. A002110, A036335, A036336, A036338.
%K A036337 nonn,base
%O A036337 1,1
%A A036337 _Patrick De Geest_, Dec 15 1998
%E A036337 More terms and better description from _Matthew Conroy_, May 25 2001
%E A036337 a(19) and a(20) from _Zak Seidov_, Oct 30 2018