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 A087450 #5 Mar 31 2012 13:20:50
%S A087450 11,12,16,26,46,61,62,121,122,182,241,242,322,301,302,422,642,646,722,
%T A087450 1006,601,602,842,962,1261,1262,1201,1202,2042,1681,1682,1922,1801,
%U A087450 1802,2102,2402,2522,3302,3361,3362,3001,3002
%N A087450 Smallest number (see comment for representation) with all identical digits having n distinct prime divisors.
%C A087450 Sequence represented by citing the number of repeated digits concatenated with that digit, i.e. a(8) = 122.
%C A087450 No more terms < 3600. - _David Wasserman_, Jun 03 2005
%e A087450 a(6) = 86 because 66666666= 2*3*11*73*101*137, is 8 digits long and has 6 distinct prime divisors.
%t A087450 PrimeFactors[n_Integer] := Flatten[Table[ #[[1]], {1}] & /@ FactorInteger[n]]; Do[k = 1; While[t = Table[j*(10^k - 1)/9, {j, 1, 9}]; l = Map[Length, Map[PrimeFactors, t]]; Position[l, n] == {}, k++ ]; d = t[[Position[l, n][[1, 1]]]]; Print[10k + Position[l, n][[1, 1]]], {n, 0, 17}]
%Y A087450 Cf. A087331.
%K A087450 base,nonn
%O A087450 1,1
%A A087450 _Robert G. Wilson v_, Sep 06 2003
%E A087450 More terms from _David Wasserman_, Jun 03 2005