88357

Appears in sequences

• Strong pseudoprimes to base 2.at n=14A001262
• Strong pseudoprimes to base 4.at n=29A020230
• Strong pseudoprimes to base 21.at n=22A020247
• Strong pseudoprimes to base 74.at n=28A020300
• Strong pseudoprimes to base 77.at n=21A020303
• Strong pseudoprimes to base 84.at n=24A020310
• Strong pseudoprimes to base 97.at n=31A020323
• Euler-Jacobi pseudoprimes: 2^((n-1)/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol.at n=34A047713
• Super-Poulet numbers: Poulet numbers whose divisors d all satisfy d|2^d-2.at n=32A050217
• Smith numbers which are also base-2 pseudoprimes.at n=4A063844
• Pseudoprimes whose prime factors do not divide any smaller pseudoprime.at n=10A084653
• For p = prime(n), a(n) is the smallest base-2 pseudoprime N (that is, 2^(N-1) = 1 mod N) such that p divides N.at n=33A085999
• Brilliant Sarrus numbers.at n=10A086837
• Overpseudoprimes to base 2: composite k such that k = A137576((k-1)/2).at n=7A141232
• a(n) is the least base-2 overpseudoprime k such that the multiplicative order of 2 mod k equals 8*n+20.at n=15A141629
• Poulet numbers (2-pseudoprimes) of the form 144*n^2 + 222*n + 85.at n=9A214017
• Fermat pseudoprimes to base 2 with two prime factors.at n=32A214305
• Fermat pseudoprimes to base 2 of the form m*n^2 + (11*m - 23)*n + 19*m - 49, where m, n >= 0.at n=32A215326
• Semiprime 2-pseudoprimes of the form 10k + 7.at n=9A216667
• Composite integers k such that 2^k == 2 (mod k*(k+1)).at n=18A217465