10277275681domain: NAppears in sequencesa(n) is the smallest Carmichael number k such that gpf(p-1) = prime(n) for all prime factors p of k.at n=13A327787