M. F. Hasler in reply to E. Angelini, <a href="http://list.seqfan.eu/pipermailoldermail/seqfan/2014-September/013697.html">The a(n)th digit of the sequence is visible in a(n)</a>, SeqFan list, Sep 27 2014

Lexicographically smallest earliest permutation of the positive integers such that a(n) contains the a(n)-th digit of the sequence, for all n.

editing

approved

d=concat(d, digits(k)); u+=1<<L=k; print_all&&print1(k", "); break)); L} \\ - __M. F. Hasler_, Sep 27 2014

a(10) cannot be 10 because in that case, the 11-th 11th digit would be "0" which does not occur in the number "11", so this number could appear nowhere else in the sequence.

approved

editing

proposed

approved

editing

proposed

Lexicographically smallest permutation of the positive integers such that a(n) contains the a(n)-th digit of the sequence, for all n.

a(10) cannot be 10 because in that case, the 11-th digit would be "0" which does not occur in the number "11", so this number could appear nowhere else in the sequence.

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, 74, 90, 52, 35, 56, 58, 50, 121, 65, 118, 101, 117, 57, 78, 70, 123, 85, 87, 110, 92, 94, 96, 79, 100, 200

M. F. Hasler in reply to E. Angelini, <a href="http://list.seqfan.eu/pipermail/seqfan/2014-September/013697.html">The a(n)th digit of the sequence is visible in a(n)</a>, SeqFan list, Sep 27 2014

See the link.

(PARI) Sa(nMax, n, print_all=0, d=[], u=0, L)={for(n=1, nMax, n, for(k=1, 9e9, bittest(u, k)&&next;

d=concat(d, digits(k)); u+=1<<L=k; print_all&&print1(k", "); next(2break)); error)L} \\ Prints the sequence but returns nothing. - M. F. Hasler, Sep 27 2014

allocated for M. F. Hasler

Lexicographically smallest permutation of the positive integers such that a(n) contains the a(n)-th digit of the sequence.

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, 74, 90, 52, 35, 56, 58, 50, 121, 65, 118, 101, 117, 57, 78, 70, 123, 85, 87, 110, 92, 94, 96, 79, 100, 200

1,2

(PARI) S(nMax, d=[], u=0)={for(n=1, nMax, 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<<k; print1(k", "); next(2)); error)} \\ Prints the sequence but returns nothing. - M. F. Hasler, Sep 27 2014

allocated

nonn,base

Eric Angelini and M. F. Hasler, Sep 27 2014

approved

editing