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

0, 10, 100, 101, 102, 120, 201, 210, 1002, 1012, 1020, 1021, 1022, 1023, 1032, 1203, 1230, 1302, 1320, 2013, 2031, 2103, 2130, 2301, 2310, 3012, 3021, 3102, 3120, 3201, 3210, 10023, 10032, 10123, 10132, 10203, 10213, 10223, 10230, 10231, 10232, 10233, 10234, 10243

Offset: 0

Author

Eric Angelini, Jun 09 2005

Keywords

• base
• easy
• nonn

Comments

Starting with another integer as 0 (the "seed") would lead to another sequence.

Examples

			After 100 we get 101 (and not 1000) because the lone 0 in "101" is considered as the copy of both zeros of "100".
		

Links

• Michael S. Branicky, Table of n, a(n) for n = 0..10000

Crossrefs

Cf. A297065.

Programs

Maple

R:= 0: S:= {0}: count:= 1;
for k from 1 while count < 100 do
  Sk:= convert(convert(k,base,10),set);
  if S subset Sk then
    R:= R, k;
    count:= count+1;
    S:= Sk;
  fi
od:
R; # Robert Israel, Nov 21 2022

Python

from itertools import islice
def agen(an=0):
    while True:
        yield an
        target, k = set(str(an)), an + 1
        while not (target <= set(str(k))): k += 1
        an = k
print(list(islice(agen(), 41))) # Michael S. Branicky, Nov 21 2022

Extensions

Missing terms a(35)-a(37) inserted by Michael S. Branicky, Nov 21 2022