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++) { for (n=1, M = 25 000 000, v=if(n==1, 1, fromdigits(Vecrev(digits(nextprime(1+v), n)), n)); if (v <= M && !seen(v), see(v); ); ); for (n=1, M, if (seen(n), print (k++ " " n); ); ); } quit