s = 0
unseen = 1
seen(v) = bit test(s, v)
see(v) = s = bit or(s, 2^v); while (seen(unseen), unseen++)

find(m) = {
	fordiv (m, d,
		if (!seen(d),
			see(d);
			return (d);
		);
	);
	print ("# the end");
	quit;
}

{
	k = 0;
	for (n=1, oo,
		if (!isprime(n),
			v=find(n);
			print (k++ " " v);
			if (k==10 000, break)
		)
	)
}

quit