800605

Appears in sequences

• Strong pseudoprimes (base-2) equal to product of 4 primes not necessarily distinct.at n=0A112451
• Smallest strong pseudoprime to base 2 with n prime factors.at n=2A180065
• Fermat pseudoprimes to base 2 divisible by 5.at n=30A216023
• Composite numbers k congruent to 5 (mod 8) such that 2^((k-1)/2) mod k = k-1.at n=10A244626
• The "non-residue" pseudoprimes: odd composite numbers n such that b(n)^((n-1)/2) == -1 (mod n), where base b(n) = A020649(n).at n=16A307767
• Odd composite numbers k such that 2^((k-1)/2) == -1 (mod k).at n=11A356638
• Square array A(n, k) read by antidiagonals downwards: smallest base-n strong Fermat pseudoprime with k distinct prime factors for k, n >= 2.at n=3A360184