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 A102823 #6 Nov 03 2014 12:52:05 %S A102823 0,1,2,3,4,5,6,7,8,9,10,12,13,14,15,16,17,18,19,20,23,24,25,26,27,28, %T A102823 29,30,34,35,36,37,38,39,40,45,46,47,48,49,50,56,57,58,59,60,67,68,69, %U A102823 70,78,79,80,89,90,100,102,103,104,105,106,107,108,109,112,113 %N A102823 "True already", base 10, start 0: a(n) is the least integer such that the sequence up to a(n-1) written in base 10 contains floor(a(n)/10) copies of the digit a(n) % 10, with a(0) = 0. %C A102823 a(n) = A249626(n) for n <= 55. - _Reinhard Zumkeller_, Nov 03 2014 %D A102823 Inspired by discussion of "True so far" from _Eric Angelini_ (A102357). %e A102823 The first 11 values of the sequence written in decimal include 2 '1's and 1 '2', so the next value cannot be 11 (the count of '1's is not 1) but can be 12. %Y A102823 Cf. A102824-A102830, A102357. %Y A102823 Cf. A249626. %K A102823 nonn,easy,base %O A102823 0,3 %A A102823 _Hugo van der Sanden_, Feb 26 2005