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 A179310 #11 Feb 01 2014 21:39:34 %S A179310 1,2,3,4,5,6,7,8,9,10,22,33,44,55,66,77,88,99,100,1111,2222,3333,4444, %T A179310 5555,6666,7777,8888,9999,10000,22222222,33333333,44444444,55555555, %U A179310 66666666,77777777,88888888,99999999,100000000,1111111111 %N A179310 The smallest number that has more copies of some digit than all previous terms of the sequence put together. %C A179310 For each natural number taken in order, we consider if we can make it using digits from as many of the previous terms as we like. If we cannot, we add it to the sequence and add its digits to the 'pool' we have for making subsequent numbers. %e A179310 This sequence is the same as A179309 up to 100. After that, we can make any three-digit number because we have had at least three of each digit so far. We can make 1000 because we have already had three 0's (in 10 and 100). So the next term is 1111 because we have only seen three 1's so far. %Y A179310 A subsequence of A179309. %K A179310 base,easy,nonn %O A179310 1,2 %A A179310 _Jack W Grahl_, Jul 10 2010 %E A179310 An error in the example (pointed out by _Jon E. Schoenfield_) was corrected by _Jack W Grahl_, Jul 19 2010 %E A179310 More terms from _Sean A. Irvine_, Nov 10 2011