90751

Appears in sequences

• Strong pseudoprimes to base 2.at n=15A001262
• Composite numbers k such that k == +-1 (mod 8) and 2^((k-1)/2) == 1 (mod k).at n=30A006971
• Strong pseudoprimes to base 4.at n=30A020230
• Strong pseudoprimes to base 18.at n=29A020244
• Strong pseudoprimes to base 47.at n=25A020273
• Strong pseudoprimes to base 65.at n=34A020291
• Strong pseudoprimes to base 72.at n=33A020298
• Strong pseudoprimes to base 75.at n=37A020301
• Strong pseudoprimes to base 89.at n=31A020315
• Strong pseudoprimes to base 94.at n=23A020320
• Euler-Jacobi pseudoprimes: 2^((n-1)/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol.at n=35A047713
• Super-Poulet numbers: Poulet numbers whose divisors d all satisfy d|2^d-2.at n=33A050217
• Pseudoprimes to both base 2 and base 3, i.e., intersection of A001567 and A005935.at n=21A052155
• Largest n-digit strong pseudoprimes (in base 2).at n=1A062852
• Brilliant Sarrus numbers.at n=11A086837
• Pseudotwinprimes p+2 for primes p such that p+2 divides p^(p+2)+2 and p+2 is composite.at n=28A100873
• Numbers to which Mersenne primes 2^p-1 can be congruent mod k! (for k > 1).at n=17A145038
• Composite numbers k such that 2^k-2 and 3^k-3 are both divisible by k and k is not a Carmichael number (A002997).at n=7A153513
• Pseudoprimes to base 2 of the form 4k+3.at n=9A177884
• Poulet numbers of the form (6k+1)*(24k+1).at n=2A182123