1024651

Appears in sequences

• Smallest n-digit Carmichael numbers.at n=4A048123
• Pseudoprimes to bases 2,5 and 7.at n=22A083736
• Pseudoprimes to bases 2,3 and 7.at n=29A083738
• Pseudoprimes to bases 2, 3, 5 and 7.at n=19A083739
• Pseudoprimes to bases 3,5 and 7.at n=22A083740
• 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=23A087788
• Carmichael numbers that are not == 1 mod 24.at n=13A097130
• Records in A098650.at n=19A098652
• 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=6A110889
• a(n) is the largest Carmichael number of the form prime(n)*prime(n')*prime(n") with n < n' < n", or 0 if no such number exists.at n=7A141706
• Odd numbers with increasing numbers of bases to which they are strong pseudoprimes.at n=31A141768
• Pseudoprimes to base 2 of the form 4k+3.at n=32A177884
• Carmichael numbers congruent to 3 modulo 4.at n=1A185321
• Composite numbers k such that k divides Fibonacci(k+1) or Fibonacci(k-1) and 2^(k-1) == 1 (mod k).at n=15A214434
• Strong pseudoprimes to bases 3 and 5.at n=2A215566
• Numbers of the form 4k+3 (A004767) that are Lucas pseudoprimes and Fermat pseudoprimes to base 2 (intersection of A005845 and A001567).at n=1A227905
• Carmichael numbers (A002997) that are not absolute Euler pseudoprimes (A033181).at n=27A262043
• Irregular triangle read by rows in which row n contains the first Carmichael number equal to m mod n where m is coprime to n, 0 <= m < n, ordered by m.at n=19A278338
• The largest 3-Carmichael number that is divisible by the n-th odd prime.at n=6A290485
• Numbers that are both Fermat pseudoprimes to base 2 (A001567) and Bruckman-Lucas pseudoprimes (A005845).at n=9A329240