1857241

Appears in sequences

• Least number for which Solovay-Strassen primality test on bases < prime(n) fails.at n=6A007324
• Least number for which Solovay-Strassen primality test on bases < prime(n) fails.at n=7A007324
• Absolute Euler pseudoprimes: odd composite numbers n such that a^((n-1)/2) == +-1 (mod n) for every a coprime to n.at n=19A033181
• Pseudoprimes to bases 2, 3, 5 and 7.at n=25A083739
• 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=28A087788
• Carmichael numbers C such that C-1 is not a Niven/Harshad number.at n=10A097061
• Records in A098650.at n=24A098652
• Carmichael numbers divisible by 31.at n=8A182151
• Carmichael numbers that have only prime divisors of the form 10k+1.at n=5A212843
• Composite numbers k such that k divides Fibonacci(k+1) or Fibonacci(k-1) and 2^(k-1) == 1 (mod k).at n=22A214434
• Fermat pseudoprimes to base 2 with three prime factors divisible by a smaller Fermat pseudoprime to base 2.at n=28A215944
• Carmichael numbers whose prime factors form an arithmetic progression.at n=5A300949
• Primary Carmichael numbers.at n=11A324316
• Numbers that are both Fermat pseudoprimes to base 2 (A001567) and Bruckman-Lucas pseudoprimes (A005845).at n=14A329240
• Euler-Fibonacci pseudoprimes: odd composites k such that F(k) == 5^((k-1)/2) == +-1 (mod k), where F(k) = A000045(k), the Fibonacci numbers.at n=9A345753
• Carmichael numbers ending in 1.at n=31A354609
• Smallest Euler-Jacobi pseudoprime to all natural bases up to prime(n) - 1 that is not a base prime(n) Euler-Jacobi pseudoprime.at n=7A354692
• Carmichael numbers whose number of prime factors is prime.at n=30A355039
• Carmichael numbers k such that k-1 is a Novak-Carmichael number.at n=9A375322