63139

Appears in sequences

• Strong pseudoprimes to base 3.at n=16A020229
• Strong pseudoprimes to base 19.at n=27A020245
• Strong pseudoprimes to base 27.at n=38A020253
• Strong pseudoprimes to base 47.at n=21A020273
• Strong pseudoprimes to base 57.at n=30A020283
• Strong pseudoprimes to base 61.at n=17A020287
• Strong pseudoprimes to base 67.at n=20A020293
• Strong pseudoprimes to base 100.at n=40A020326
• Base-3 Euler-Jacobi pseudoprimes.at n=29A048950
• Euler pseudoprimes to base 3: composite integers such that abs(3^((n - 1)/2)) == 1 mod n.at n=34A262051
• Super pseudoprimes (or superpseudoprimes) to base 3: Fermat pseudoprimes to base 3 all of whose divisors that are larger than 1 are either primes or Fermat pseudoprimes to base 3.at n=30A328662
• Composite numbers k such that (1 - w)^(k-1) == 1 (mod k) in the ring of Eisenstein integers (w = (-1 + sqrt(3)*i)/2).at n=28A329705
• Composite numbers k == 5, 7 (mod 12) such that 3^((k-1)/2) == -1 (mod k).at n=7A375918
• Consecutive states of the linear congruential pseudo-random number generator (25173*s+13849) mod 2^16 when started at s=1.at n=14A383940