This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095205 Beginning with 0 least number with an attempt to maintain the frequency of occurrence of digits as far as possible identical. Priority is in the order 0 to 9. At any stage the frequency of digit r must be more than any other digit s if r < s. 1
 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 23, 45, 67, 89, 102, 34, 56, 78, 90, 12, 43, 65, 87 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS 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. conjecture: m is not equal to d, i.e. m < d. Question: what is m? LINKS EXAMPLE 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. CROSSREFS Cf. A095204. Sequence in context: A120125 A095204 A106604 * A161978 A132579 A004850 Adjacent sequences:  A095202 A095203 A095204 * A095206 A095207 A095208 KEYWORD base,more,nonn,uned AUTHOR Amarnath Murthy, Jun 06 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 23 03:10 EDT 2019. Contains 323507 sequences. (Running on oeis4.)