8714965001domain: 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=23A327787Carmichael numbers k for which bigomega(phi(k)) < bigomega(k-1), where bigomega gives the number of prime divisors, counted with multiplicity.at n=20A339909