big = 1 000 000
s = 0
S = Set([])
unseen = 1
seen(v) = if (v < big, bit test(s, v), set search(S, v))
see(v) = if (v < big, s = bit or(s, 2^v), S = set union(S, Set([v]))); while (seen(unseen), unseen++)

mx = 1679616000000

vv = [0]
nb = 0

explore(v) = {
	if (v<=mx && !seen(v),
		see(v);
		if (#vv<nb++,
			vv=concat(vv, vector(#vv));
		);
		vv[nb]=v;

		for (d=2, 9,
			my (vd=v*d);
			if (setsearch (Set(digits(vd)), d),
				explore (vd);
			);
		);
	);
}

explore(1);

apply (v -> print (n++ " " v), Set(vv[1..nb]))

quit