384266404601domain: NAppears in sequencesa(n) is the smallest k with n prime factors such that 2^(k-1) == 1 (mod k) and p-1 does not divide k-1 for every prime p dividing k.at n=3A316908