a(n) is the smallest k with n prime factors such that p^k == p (mod k) for every prime p dividing k