

A302095


a(n) is the smallest positive integer not yet in the increasing sequence that is obtained when the largest digit from a(n1) is deleted and the remaining digits are permuted such that no digit in a(n) has the same position it had in a(n1) (counting from left to right). No repeated digits allowed; a(1)=10.


1



10, 230, 402, 520, 602, 720, 802, 920, 1023, 2104, 3012, 4120, 5012, 6120, 7012, 8120, 9012, 12034, 20153, 31024, 50132, 61023, 70132, 81023, 90132, 120435, 201346, 310254, 401326, 510234, 601342, 710234, 801342, 910234, 1023456, 2104375, 3012456, 4103275, 5012346, 7103254
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

All terms in the sequence contain 0.
The fact that all digits in the terms are distinct makes the sequence finite.
In fact, the sequence contains 59 terms and a(59)=901325476.
The terms that require the smallest number of permutations to recover their natural ordering are a(1)=10, a(9)=1023 and a(35)=1023456 (one permutation required).


LINKS

Enrique Navarrete, Table of n, a(n) for n = 1..59


EXAMPLE

a(2)=230 since it is the smallest positive integer not yet in the sequence that is obtained when the largest digit 1 from a(1)=10 is deleted, the remaining digit 0 is permuted from the second to third place, and no digits are repeated.


CROSSREFS

Cf. A107353, A297418.
Sequence in context: A092254 A211079 A211084 * A276019 A004702 A027952
Adjacent sequences: A302092 A302093 A302094 * A302096 A302097 A302098


KEYWORD

nonn,base,fini,full


AUTHOR

Enrique Navarrete, May 19 2018


STATUS

approved



