60701

Appears in sequences

• Strong pseudoprimes to base 26.at n=18A020252
• Strong pseudoprimes to base 54.at n=26A020280
• Strong pseudoprimes to base 90.at n=19A020316
• Super-Poulet numbers: Poulet numbers whose divisors d all satisfy d|2^d-2.at n=25A050217
• Pseudoprimes whose prime factors do not divide any smaller pseudoprime.at n=8A084653
• 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=24A085999
• Brilliant Sarrus numbers.at n=8A086837
• Sarrus numbers that become prime when two is added.at n=7A137198
• Auxiliary r(n) sequence used to prove some properties about Rowland's sequence: r(1) = 1, and r(n) = 1/2*(c(n)+1), where c(n) is A190894, for n>1.at n=44A190895
• Lesser of pseudo twin primes to base 2.at n=31A192297
• 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=30A210993
• Fermat pseudoprimes to base 2 with two prime factors.at n=25A214305
• Pseudoprimes to a twin prime criterion of Aebi and Cairns.at n=8A224695
• Fermat pseudoprimes to base 2 which are not Euler pseudoprimes to base 2.at n=25A227136
• Composite numbers n such that every divisor of n greater than one contains the digit 0.at n=15A243819
• Composite integers k such that 2^d == 2^(k/d) (mod k) for all d|k.at n=27A291601
• 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=28A291617
• Semiprimes k = pq such that p^k == p (mod k) and q^k == q (mod k).at n=37A294169
• Fermat pseudoprimes to base 2 that are tetradecagonal.at n=1A322123