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, 3333,

		x = unseen;
		for (y=x+1, oo,
			if (!seen(y),
				z=y^2/x;
				if (type(z)==type(42) && !seen(z),
					see(x);
					see(y);
					see(z);

					print (3*n-2 " " x);
					print (3*n-1 " " y);
					print (3*n   " " z);

					break;
				);
			);
		);

	);
}

quit