1050985
domain: N
Appears in sequences
- Absolute Euler pseudoprimes: odd composite numbers n such that a^((n-1)/2) == +-1 (mod n) for every a coprime to n.at n=16A033181
- Carmichael numbers C such that C-1 is not a Niven/Harshad number.at n=9A097061
- Carmichael numbers equal to the product of 5 primes.at n=1A112428
- Pseudoprimes (base-2) equal to the product of 5 primes not necessarily distinct.at n=1A112443
- Carmichael numbers with more than 3 prime factors.at n=21A141711
- Carmichael numbers of the form C = p*(2p-1)*(n*(2p-2)+p), where p and 2p-1 are prime numbers.at n=18A182207
- Fermat pseudoprimes to base 2 divisible by 5.at n=34A216023
- Numbers n > 2 such that A258409(n)*A002322(n) divides n-1.at n=7A284671
- Carmichael numbers k for which A053575(k) [the odd part of phi] does not divide k-1.at n=34A340092
- Carmichael numbers whose number of prime factors is prime.at n=25A355039
- Carmichael numbers ending in 5.at n=7A355305
- The greater of twin Carmichael numbers: a pair of consecutive Carmichael numbers (A002997) without a non-prime-power weak Carmichael number (A087442) between them.at n=6A365023
- Smallest n-bit Carmichael number, or 0 if no such number exists.at n=11A375875
- Carmichael numbers ordered by largest prime factor, then by size.at n=7A376485