The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A248651 a(n) is the smallest number greater than a(n-1) such that no digit appears in the listing of all terms more than one time more than any other digit in the listing, with a(1) = 1. 1
 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 20, 34, 56, 78, 90, 123, 456, 789, 790, 812, 3456, 3501, 4267, 4289, 5013, 6789, 6790, 8123, 8145, 9023, 14567, 20345, 26789, 30145, 36789, 40125, 46789, 50123, 56789, 60123, 64789, 70123, 74589, 80123, 84569, 90123, 94567, 102345, 102678, 345678, 345679, 380129, 401256, 401789 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Starting with 1, instead of 0 as in A095204, means 0 doesn't appear until a(10)=10, hence a(11)=20, not 23. This creates an inconsistent offset from that sequence. LINKS Jeb Adams, Table of n, a(n) for n = 1..64 CROSSREFS Same definition of A095204, but starting with 1. Similar to A120125, except it respects increasing. Sequence in context: A201982 A166508 A223080 * A306361 A068861 A256079 Adjacent sequences:  A248648 A248649 A248650 * A248652 A248653 A248654 KEYWORD nonn,base AUTHOR Jeb Adams, Oct 10 2014 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 January 29 10:34 EST 2020. Contains 331337 sequences. (Running on oeis4.)