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 A179309 #5 May 31 2016 15:36:38
%S A179309 1,2,3,4,5,6,7,8,9,10,11,22,33,44,55,66,77,88,99,100,111,222,333,444,
%T A179309 555,666,777,888,999,1000,1111,2222,3333,4444,5555,6666,7777,8888,
%U A179309 9999,10000,11111,22222,33333,44444,55555,66666,77777,88888,99999,100000
%N A179309 The smallest number that has more copies of some digit than any previous number in the sequence.
%C A179309 These are, for each digit d and each natural number k, the smallest positive number in which the digit d appears k (or more) times, in numerical order. They are all numbers with all digits repeated except numbers of the form 10^m.
%C A179309 If we started with 0 the term 10 would be missed and all other terms would be the same.
%e A179309 100 is included because no previous term contains two 0's. 111 is included because no previous term contains more than 2 1's. Every number between 101 and 110 inclusive is omitted because each contains at most 2 1's (no more than 11) and at most 1 of any other digit (no more than 2 thru 10).
%t A179309 With[{nn=5},Join[Flatten[Table[FromDigits[PadRight[{},i,n]],{i,nn},{n,9}]],10^Range[nn]]]//Sort (* _Harvey P. Dale_, May 31 2016 *)
%Y A179309 Supersequence of A014181 and A010785. See also A179310.
%K A179309 base,easy,nonn
%O A179309 1,2
%A A179309 _Jack W Grahl_, Jul 10 2010