314821

Appears in sequences

• Strong pseudoprimes to base 2.at n=26A001262
• Carmichael numbers: composite numbers k such that a^(k-1) == 1 (mod k) for every a coprime to k.at n=25A002997
• Carmichael numbers which are also base-2 strong pseudoprimes.at n=4A063847
• Pseudoprimes to bases 2 and 5.at n=26A083732
• Pseudoprimes to bases 2 and 7.at n=19A083733
• Pseudoprimes to bases 3 and 5.at n=25A083734
• Pseudoprimes to bases 3 and 7.at n=24A083735
• Pseudoprimes to bases 2,5 and 7.at n=8A083736
• Pseudoprimes to bases 2, 3 and 5.at n=19A083737
• Pseudoprimes to bases 2,3 and 7.at n=14A083738
• Pseudoprimes to bases 2, 3, 5 and 7.at n=7A083739
• Pseudoprimes to bases 3,5 and 7.at n=9A083740
• 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=16A087788
• Carmichael numbers that are not == 1 mod 24.at n=10A097130
• Devaraj numbers: squarefree r-prime-factor (r>1) integers N=p1*...*pr such that phi(N)=(p1-1)*...*(pr-1) divides gcd(p1-1,...,pr-1)^2*(N-1)^(r-2).at n=28A104016
• Strong pseudoprimes (base-2) equal to product of 3 primes not necessarily distinct.at n=5A112450
• Increasing gaps between 2-pseudoprimes (upper end).at n=15A175737
• Odd composite numbers m for which A000111(m) == (-1)^( (m-1)/2 ) (mod m).at n=36A180942
• Intersection of A001567 and A212502.at n=14A212601
• Poulet numbers (2-pseudoprimes) of the form 7200*n^2 + 8820*n + 2701.at n=5A214016