This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A247945 Lexicographically earliest permutation of the positive integers such that a(n) contains the a(n)-th digit of the sequence, for all n. 0
 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 15, 17, 19, 21, 22, 25, 27, 29, 31, 23, 33, 37, 39, 41, 24, 44, 47, 49, 51, 53, 45, 55, 59, 61, 26, 46, 66, 69, 71, 73, 75, 67, 77, 81, 28, 48, 68, 88, 91, 93, 95, 97, 89, 10, 20, 40, 60, 80, 111, 14, 16, 18, 12, 112, 42, 62, 82, 113, 34, 36, 38, 30, 114, 116 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS M. F. Hasler in reply to E. Angelini, The a(n)th digit of the sequence is visible in a(n), SeqFan list, Sep 27 2014 EXAMPLE See the link. a(10) cannot be 10 because in that case, the 11th digit would be "0" which does not occur in the number "11", so this number could appear nowhere else in the sequence. PROG (PARI) a(n, print_all=0, d=[], u=0, L)={for(n=1, n, for(k=1, 9e9, bittest(u, k)&&next; for(j=1, #dk=digits(k), setsearch(Set(digits(#d+j)), dk[j])||next(2)); d=concat(d, digits(k)); u+=1<

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 December 7 20:33 EST 2019. Contains 329849 sequences. (Running on oeis4.)