cp's OEIS Frontend

A054659 Increasing sequence with no repeating digits and no digits shared with previous term.

%I A054659 #9 Jul 01 2022 05:33:57
%S A054659 0,1,2,3,4,5,6,7,8,9,10,23,40,51,60,71,80,91,203,415,602,713,802,913,
%T A054659 2045,3167,4025,6137,8024,9135,20467,31589,40267,51389,60247,81359
%N A054659 Increasing sequence with no repeating digits and no digits shared with previous term.
%C A054659 a(11)=23 since a(10)=10 and any number from 11 to 21 would share a digit between the two terms while 22 has a repeated digit
%o A054659 (Python)
%o A054659 def ok(s, t): return len(set(t)) == len(t) and len(set(s+t)) == len(s+t)
%o A054659 def agen(): # generator of complete sequence of terms
%o A054659     an, MAX = 0, 987654321
%o A054659     while True:
%o A054659         if an < MAX: yield an
%o A054659         else: return
%o A054659         an, s = an+1, str(an)
%o A054659         MAX = 10**(10-len(s))
%o A054659         while an < MAX and not ok(s, str(an)): an += 1
%o A054659 print(list(agen())) # _Michael S. Branicky_, Jun 30 2022
%Y A054659 Cf. A030283.
%K A054659 nonn,base,easy,fini,full
%O A054659 1,3
%A A054659 _Henry Bottomley_, Apr 18 2000