79624621

Appears in sequences

• The least 3-Carmichael number that is divisible by the n-th odd prime, or 0 if no such number exists.at n=32A290486
• a(n) is the smallest Carmichael number k such that gpf(p-1) = prime(n) for all prime factors p of k.at n=7A327787
• Imprimitive Carmichael numbers: Carmichael numbers m such that if m = p_1 * p_2 * ... *p_k is the prime factorization of m then g(m) = gcd(p_1 - 1, ..., p_k - 1) > sqrt(lambda(m)), where lambda is the Carmichael lambda function (A002322).at n=21A328935
• Composites that cause a witness to be added to a set of Fermat witnesses: a(n) is the smallest composite number that is not guaranteed composite using Fermat's Little Theorem by the witness A380978(i) for any i < n.at n=30A380979