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++) base = 10 expl(p,i,s) = { my (v); fordiv (i, d, v=fromdigits(concat([p, digits(d, base), s]), base); if (!seen(v), return (v); ); ); forstep (m=2*i, oo, i, v=fromdigits(concat([p, digits(m, base), s]), base); if (!seen(v), return (v); ); ); } other(p) = { see(p); my (d=digits(p, base), v=oo); for (i=1, #d, if (d[i], for (j=i, #d, my (m=fromdigits(d[i..j], base)); v=min(v, expl(d[1..i-1], m, d[j+1..#d])); ); ); ); v } for (n=1, 10 000, print (n " " v=if (n==1, 1, other(v)))) quit