cp's OEIS Frontend

A107411 Each digit of a(n) appears in a(n+1) and a(n+1) > a(n) is minimal.

%I A107411 #13 Nov 22 2022 02:37:46
%S A107411 0,10,100,101,102,120,201,210,1002,1012,1020,1021,1022,1023,1032,1203,
%T A107411 1230,1302,1320,2013,2031,2103,2130,2301,2310,3012,3021,3102,3120,
%U A107411 3201,3210,10023,10032,10123,10132,10203,10213,10223,10230,10231,10232,10233,10234,10243
%N A107411 Each digit of a(n) appears in a(n+1) and a(n+1) > a(n) is minimal.
%C A107411 Starting with another integer as 0 (the "seed") would lead to another sequence.
%H A107411 Michael S. Branicky, <a href="/A107411/b107411.txt">Table of n, a(n) for n = 0..10000</a>
%e A107411 After 100 we get 101 (and not 1000) because the lone 0 in "101" is considered as the copy of both zeros of "100".
%p A107411 R:= 0: S:= {0}: count:= 1;
%p A107411 for k from 1 while count < 100 do
%p A107411   Sk:= convert(convert(k,base,10),set);
%p A107411   if S subset Sk then
%p A107411     R:= R, k;
%p A107411     count:= count+1;
%p A107411     S:= Sk;
%p A107411   fi
%p A107411 od:
%p A107411 R; # _Robert Israel_, Nov 21 2022
%o A107411 (Python)
%o A107411 from itertools import islice
%o A107411 def agen(an=0):
%o A107411     while True:
%o A107411         yield an
%o A107411         target, k = set(str(an)), an + 1
%o A107411         while not (target <= set(str(k))): k += 1
%o A107411         an = k
%o A107411 print(list(islice(agen(), 41))) # _Michael S. Branicky_, Nov 21 2022
%Y A107411 Cf. A297065.
%K A107411 base,easy,nonn
%O A107411 0,2
%A A107411 _Eric Angelini_, Jun 09 2005
%E A107411 Missing terms a(35)-a(37) inserted by _Michael S. Branicky_, Nov 21 2022