10267951

Appears in sequences

• Carmichael numbers that are not == 1 mod 24.at n=31A097130
• 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=11A110889
• 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=17A135720
• 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=18A141705
• Carmichael numbers congruent to 3 modulo 4.at n=4A185321
• Strong pseudoprimes to bases 11, 13 and 17.at n=0A188755
• Carmichael numbers that are not of the form x^2 + y^2 + z^2 where x, y and z are integers.at n=2A267462
• Primary Carmichael numbers.at n=20A324316
• 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=11A328935
• Carmichael numbers that are products of primes p for which each p-1 is squarefree.at n=0A328939
• Carmichael numbers all of whose prime factors are congruent to 3 modulo 4.at n=7A329468
• Odd squarefree composite numbers k such that p-1 divides k-1 and p-1 does not divide (k-1)/2 for every prime p|k.at n=7A329799
• 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=19A380979
• Carmichael numbers with exactly 3 prime factors, p*q*r, such that p-1, q-1 and r-1 have an equal 2-adic valuation.at n=7A382791