big = 1 000 000
s = 0
S = []
unseen = 1
seen(v) = if (v < big, bittest(s, v), setsearch(S, v))
see(v) = if (v < big, s = bitor(s, 2^v), S = setunion(S, [v])); while (seen(unseen), unseen++)

{
	m = [2];	\\ multiples of primes

	for (n = 1, 10 000,
		if (n==1,
				v = 1,
			n==2,
				v = 2,

				ppp = pp*p;
				pi = 0;
				forprime (q = 2, oo,
					if (pi++ > #m,
						m = concat(m, q);
					);

					if (ppp % q,
						while (seen(m[pi]),
							m[pi] += q;
						);
						v = m[pi];
						break;
					);
				);
		);

		see(v);

		f = factor(v);

		print (n " " sum(k=1, #f~, 2^primepi(f[k, 1]))/2);

		[pp, p] = [p, v];
	);
}

quit