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 A095205 #29 Feb 23 2020 13:54:37 %S A095205 0,1,2,3,4,5,6,7,8,9,10,23,45,67,89,102,34,56,78,90,12,43,65,87,109, %T A095205 32,54,76,98,120,345,678,190,234,567,809,21,354,687,901,243,576,890, %U A095205 123,456,789,201,435,768,910,324,657,908,132,465,798,210,453,786,1029 %N A095205 Least nonnegative integer not already in the sequence such that the frequency of digits in the entire sequence is as close to a uniform distribution as possible. A difference in frequency of at most 1 across all digits is allowed, and that difference must always be in favor of digits closer to 0. %C A095205 Obviously no term contains identical digits and eventually for some m, a(m) = 1023456789 = a(n) for all n > m. Let d = number of numbers containing all distinct digits, using digits 0 to 9, then is it conjectured that: m is not equal to d, i.e., m < d. Question: what is m? %H A095205 Micah Manary, <a href="/A095205/b095205.txt">Table of n, a(n) for n = 0..1000</a> %H A095205 Micah Manary, <a href="/A095205/a095205.txt">Python script for A095205</a> %e A095205 After 89 the next term is 102. It is not 11 or 12 as 0 has to occur first, it is not 20 as 1 has to occur earlier to 2. %Y A095205 Cf. A095204. %K A095205 base,nonn %O A095205 0,3 %A A095205 _Amarnath Murthy_, Jun 06 2004 %E A095205 Better definition and more terms from _Micah Manary_, Nov 13 2019