65077

Appears in sequences

• Strong pseudoprimes to base 4.at n=23A020230
• Super-Poulet numbers: Poulet numbers whose divisors d all satisfy d|2^d-2.at n=27A050217
• a(n) = 1 + 4*n*(1 + 2*n^2)/3.at n=29A171272
• Fermat pseudoprimes to base 2 of the form (6*k - 1)*((6*k - 2)*n + 1), where k and n are positive integers.at n=32A210993
• Fermat pseudoprimes to base 2 with two prime factors.at n=27A214305
• Fermat pseudoprimes to base 2 of the form m*n^2 + (11*m - 23)*n + 19*m - 49, where m, n >= 0.at n=26A215326
• Semiprime 2-pseudoprimes of the form 10k + 7.at n=8A216667
• Composite integers k such that 2^d == 2^(k/d) (mod k) for all d|k.at n=29A291601
• Numbers p_1*p_2*...*p_k such that (2^p_1-1)*(2^p_2-1)*...*(2^p_k-1) is a Poulet number (A001567), where p_i are primes and k >= 2.at n=30A291617
• Odd numbers k > 1 such that 2^((k-1)/2) == -(2/k) = -A091337(k) (mod k), where (2/k) is the Jacobi (or Kronecker) symbol.at n=6A306310
• The "residue" pseudoprimes: odd composite numbers n such that q(n)^((n-1)/2) == 1 (mod n), where base q(n) is the smallest prime quadratic residue modulo n.at n=33A307798
• Pseudoprimes congruent to 7 mod 10.at n=9A317972
• Consecutive internal states of the linear congruential pseudo-random number generator (421*s + 54773) mod 259200 when started at 1.at n=12A383129