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++)

total = 2

other() = {
	fordiv(total, v,
		if (!seen(v),
			return (v);
		);
	);
	print ("#the end");
	quit;
}

{
	for (n=1, 10 000,
		v = other();
		print (n " " total/v);
		total += v;
		see(v);
	);
}

quit