84350561

Appears in sequences

• Carmichael numbers that are not == 1 mod 12. There are 69 Carmichael numbers out to 2*m+1, m=2*10^6 and all but the above 9 are 1 mod 12.at n=19A110889
• a(n) is the smallest Carmichael number (A002997) with the n-th prime as its smallest prime divisor, or 0 if no such number exists.at n=26A135720
• a(n) is the smallest Carmichael number (A002997) divisible by the n-th prime, or 0 if no such number exists.at n=26A135721
• Numbers that occur more than once in A193873, in order of appearance.at n=25A194263
• Carmichael numbers whose prime factors do not divide any smaller Carmichael number.at n=1A202562
• Carmichael numbers not congruent to 1 modulo 6.at n=11A205947
• The least 3-Carmichael number that is divisible by the n-th odd prime, or 0 if no such number exists.at n=26A290486
• a(n) is the smallest Carmichael number k such that gpf(p-1) = prime(n) for all prime factors p of k.at n=14A327787
• 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=23A328935
• Carmichael numbers k for which the 2-adic valuation of phi(k) does not exceed the 2-adic valuation of k-1.at n=14A339818
• Carmichael numbers k for which bigomega(phi(k)) < bigomega(k-1), where bigomega gives the number of prime divisors, counted with multiplicity.at n=2A339909