83333
domain: N
Appears in sequences
- Strong pseudoprimes to base 4.at n=27A020230
- Strong pseudoprimes to base 6.at n=23A020232
- Strong pseudoprimes to base 13.at n=21A020239
- Strong pseudoprimes to base 24.at n=23A020250
- Strong pseudoprimes to base 31.at n=17A020257
- Strong pseudoprimes to base 37.at n=26A020263
- Strong pseudoprimes to base 52.at n=27A020278
- Strong pseudoprimes to base 54.at n=30A020280
- Strong pseudoprimes to base 55.at n=24A020281
- Strong pseudoprimes to base 77.at n=20A020303
- Strong pseudoprimes to base 78.at n=26A020304
- Strong pseudoprimes to base 83.at n=24A020309
- Strong pseudoprimes to base 96.at n=30A020322
- a(n) = floor(10^6/n).at n=11A033426
- Super-Poulet numbers: Poulet numbers whose divisors d all satisfy d|2^d-2.at n=30A050217
- Pseudoprimes to both base 2 and base 3, i.e., intersection of A001567 and A005935.at n=18A052155
- Pseudoprimes whose prime factors do not divide any smaller pseudoprime.at n=9A084653
- 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=37A085999
- Brilliant Sarrus numbers.at n=9A086837
- Least integer multiple of f(1/n) where f(1/n) is the number obtained by retaining only n digits after decimal and deleting the rest.at n=5A095199