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 A199166 #14 Aug 03 2014 14:01:35
%S A199166 2,4,8,88,888,222222,444444,888888,444444444444,888888888888,
%T A199166 444444444444444444,888888888888888888,888888888888888888888888,
%U A199166 222222222222222222222222222222,444444444444444444444444444444,888888888888888888888888888888
%N A199166 Smallest number with all identical digits having n prime factors with multiplicity.
%F A199166 min{ A010785(k): A001222(A010785(k)) = n}. - R. J. Mathar, Nov 03 2011
%e A199166 a(7) = 444444 = 2^2*3*7*11*13*37 has 7 prime factors with multiplicity, hence 444444 is in the sequence.
%p A199166 with(numtheory):for n from 1 to 17 do:i:=0:for k from 1 to 60 while(i=0)do:for a from 1 to 9 while(i=0)do:x:=((10^k- 1)/9)*a:if bigomega(x)=n then i:=1:printf(`%d, `,x):else fi:od:od:od:
%t A199166 Table[digs = 1; While[i = 1; While[num = FromDigits[Table[i, {digs}]]; stop = (i > 9) || PrimeOmega[num] == n; ! stop, i++]; i > 9, digs++]; num, {n, 16}] (* _T. D. Noe_, Nov 03 2011 *)
%Y A199166 Cf. A087331.
%K A199166 nonn,base
%O A199166 1,1
%A A199166 _Michel Lagneau_, Nov 03 2011