This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A302095 #65 Jun 28 2018 14:58:03 %S A302095 10,230,402,520,602,720,802,920,1023,2104,3012,4120,5012,6120,7012, %T A302095 8120,9012,12034,20153,31024,50132,61023,70132,81023,90132,120435, %U A302095 201346,310254,401326,510234,601342,710234,801342,910234,1023456,2104375,3012456,4103275,5012346,7103254 %N A302095 a(n) is the smallest positive integer not yet in the increasing sequence that is obtained when the largest digit from a(n-1) is deleted and the remaining digits are permuted such that no digit in a(n) has the same position it had in a(n-1) (counting from left to right). No repeated digits allowed; a(1)=10. %C A302095 All terms in the sequence contain 0. %C A302095 The fact that all digits in the terms are distinct makes the sequence finite. %C A302095 In fact, the sequence contains 59 terms and a(59)=901325476. %C A302095 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). %H A302095 Enrique Navarrete, <a href="/A302095/b302095.txt">Table of n, a(n) for n = 1..59</a> %e A302095 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. %Y A302095 Cf. A107353, A297418. %K A302095 nonn,base,fini,full %O A302095 1,1 %A A302095 _Enrique Navarrete_, May 19 2018