851703301

Appears in sequences

• Carmichael numbers whose prime factors do not divide any smaller Carmichael number.at n=2A202562
• a(n) is the smallest Carmichael number k such that gpf(p-1) = prime(n) for all prime factors p of k.at n=22A327787
• Carmichael numbers k for which bigomega(phi(k)) < bigomega(k-1), where bigomega gives the number of prime divisors, counted with multiplicity.at n=10A339909