488881

Appears in sequences

• Carmichael numbers: composite numbers k such that a^(k-1) == 1 (mod k) for every a coprime to k.at n=31A002997
• Absolute Euler pseudoprimes: odd composite numbers n such that a^((n-1)/2) == +-1 (mod n) for every a coprime to n.at n=10A033181
• Pseudoprimes to bases 2 and 5.at n=32A083732
• Pseudoprimes to bases 2 and 7.at n=25A083733
• Pseudoprimes to bases 2,5 and 7.at n=13A083736
• Pseudoprimes to bases 2, 3 and 5.at n=24A083737
• Pseudoprimes to bases 2,3 and 7.at n=20A083738
• Pseudoprimes to bases 2, 3, 5 and 7.at n=12A083739
• Pseudoprimes to bases 3,5 and 7.at n=14A083740
• 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=20A087788
• Records in A098650.at n=15A098652
• Nonprime numbers k such that k divides 3^((k+1)/2) - 2^((k+1)/2) - 1.at n=32A130062
• Carmichael numbers of the form (30k+7)*(60k+13)*(150k+31).at n=1A182085
• Carmichael numbers of the form C = 37*73*(18n+91).at n=1A182206
• Carmichael numbers of the form C = p*(2p-1)*(n*(2p-2)+p), where p and 2p-1 are prime numbers.at n=10A182207
• Intersection of A001567 and A212502.at n=18A212601
• Pseudoprimes divisible by a smaller pseudoprime.at n=27A215150
• Fermat pseudoprimes to base 2 with three prime factors divisible by a smaller Fermat pseudoprime to base 2.at n=10A215944
• Carmichael numbers whose prime factors all have the form p=1+x^2+y^2 for some x,y in Z.at n=3A258839
• Carmichael numbers (A002997) that are the sum of two squares.at n=12A265237