1461241

Appears in sequences

• Pseudoprimes to bases 2,5 and 7.at n=27A083736
• Pseudoprimes to bases 2, 3, 5 and 7.at n=22A083739
• Pseudoprimes to bases 3,5 and 7.at n=26A083740
• 3-Carmichael numbers: Carmichael numbers equal to the product of 3 primes: k = p*q*r, where p < q < r are primes such that a^(k-1) == 1 (mod k) if a is prime to k.at n=26A087788
• Records in A098650.at n=22A098652
• Carmichael numbers of the form C = 37*73*(18n+91).at n=2A182206
• Carmichael numbers of the form C = p*(2p-1)*(n*(2p-2)+p), where p and 2p-1 are prime numbers.at n=20A182207
• Intersection of A001567 and A212502.at n=27A212601
• Fermat pseudoprimes to base 2 with three prime factors divisible by a smaller Fermat pseudoprime to base 2.at n=21A215944
• Carmichael numbers (A002997) that are not absolute Euler pseudoprimes (A033181).at n=32A262043
• Carmichael numbers (A002997) that are the sum of two squares.at n=15A265237
• 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=5A328935
• Carmichael numbers k for which A053575(k) [the odd part of phi] does not divide k-1.at n=38A340092
• Carmichael numbers ending in 1.at n=29A354609
• Carmichael numbers whose number of prime factors is prime.at n=28A355039
• Carmichael numbers k such that k-1 is a Novak-Carmichael number.at n=7A375322