1152271

Appears in sequences

• Pseudoprimes to bases 2,5 and 7.at n=24A083736
• Pseudoprimes to bases 2, 3, 5 and 7.at n=20A083739
• Pseudoprimes to bases 3,5 and 7.at n=23A083740
• Least pseudoprime to base 2 through base prime(n).at n=12A083876
• 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=24A087788
• Carmichael numbers that are not == 1 mod 24.at n=15A097130
• Records in A098650.at n=20A098652
• 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=7A110889
• 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=12A135720
• a(n) is the smallest Carmichael number (A002997) divisible by the n-th prime, or 0 if no such number exists.at n=29A135721
• 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=13A141705
• Odd numbers with increasing numbers of bases to which they are strong pseudoprimes.at n=33A141768
• Pseudoprimes to base 2 of the form 4k+3.at n=35A177884
• Carmichael numbers of the form C = (30n-17)*(90n-53)*(150n-89).at n=1A182133
• Carmichael numbers congruent to 3 modulo 4.at n=2A185321
• Smallest product of three distinct primes of the form n*k+1.at n=20A193873
• Numbers that occur more than once in A193873, in order of appearance.at n=9A194263
• Fermat pseudoprimes to base 2 with three prime factors divisible by a smaller Fermat pseudoprime to base 2.at n=19A215944
• Carmichael numbers (A002997) that are not absolute Euler pseudoprimes (A033181).at n=30A262043
• Composite numbers n such that gcd(phi(n), n-1) = lambda(n), where lambda(n) = A002322(n).at n=21A264012