17098369

Appears in sequences

• 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=28A135720
• Carmichael numbers k such that the odd part of k-1 is squarefree.at n=18A263403
• Carmichael numbers k that satisfy 2^d == 2^(k/d) (mod k) for all d|k and are not Super-Poulet numbers (A050217).at n=3A291612
• Carmichael numbers k such that 2^d == 2^(k/d) (mod k) for all d|k.at n=4A291616
• a(1) = 561; a(n+1) = smallest Fermat pseudoprime to all natural bases up to lpf(a(n)).at n=10A300629
• Primary Carmichael numbers.at n=26A324316
• 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=13A328935
• Carmichael numbers (A002997) that are not minimal in their family.at n=6A335584
• Records in A083876.at n=10A348258
• Carmichael numbers ending in 9.at n=8A352970
• Least Euler pseudoprime to base 2 through base prime(n).at n=25A354694
• Least Euler pseudoprime to base 2 through base prime(n).at n=26A354694
• Least Euler pseudoprime to base 2 through base prime(n).at n=27A354694
• Least Euler pseudoprime to base 2 through base prime(n).at n=28A354694
• 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=21A380979