6733693

Appears in sequences

• Least pseudoprime to base 2 through base prime(n).at n=25A083876
• Least pseudoprime to base 2 through base prime(n).at n=26A083876
• Least pseudoprime to base 2 through base prime(n).at n=27A083876
• Carmichael numbers that are not == 1 mod 24.at n=25A097130
• 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=27A135720
• a(1) = 561; a(n+1) = smallest Fermat pseudoprime to all natural bases up to lpf(a(n)).at n=9A300629
• Primary Carmichael numbers.at n=16A324316
• 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=10A328935
• Records in A083876.at n=9A348258
• Carmichael numbers ending in 3.at n=8A355309
• 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=17A380979