10024561

Appears in sequences

• Smallest n-digit Carmichael numbers.at n=5A048123
• 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=18A135720
• a(n) is the smallest Carmichael number (A002997) divisible by the n-th prime, or 0 if no such number exists.at n=18A135721
• a(n) is the least Carmichael number of the form prime(n)*prime(n')*prime(n") with n < n' < n", or 0 if no such number exists.at n=19A141705
• Carmichael numbers that have only prime divisors of the form 10k+1.at n=16A212843
• Least Carmichael number that is divisible by the n-th cyclic number A003277(n), or 0 if no such number exists.at n=24A253595
• The least 3-Carmichael number that is divisible by the n-th odd prime, or 0 if no such number exists.at n=18A290486
• Primary Carmichael numbers.at n=19A324316
• Carmichael numbers k such that k-1 is a Novak-Carmichael number.at n=19A375322
• 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=18A380979