a(n) is the smallest b > 0 such that b^(2n) + 1 has all prime divisors p == 1 (mod 2n)