3057601

Appears in sequences

• Absolute Euler pseudoprimes: odd composite numbers n such that a^((n-1)/2) == +-1 (mod n) for every a coprime to n.at n=24A033181
• Smallest number k such that gcd(phi(k), k-1) = n * lambda(k).at n=27A284089
• Imprimitive Carmichael numbers: Carmichael numbers m such that if m = p_1 * p_2 * ... *p_k is the prime factorization of m then g(m) = gcd(p_1 - 1, ..., p_k - 1) > sqrt(lambda(m)), where lambda is the Carmichael lambda function (A002322).at n=6A328935
• Carmichael numbers (A002997) that are not minimal in their family.at n=3A335584
• Carmichael numbers k for which the 2-adic valuation of phi(k) does not exceed the 2-adic valuation of k-1.at n=2A339818
• Carmichael numbers ending in 1.at n=38A354609
• Least Euler pseudoprime to base 2 through base prime(n).at n=11A354694
• Least Euler pseudoprime to base 2 through base prime(n).at n=12A354694
• Carmichael numbers whose number of prime factors is prime.at n=33A355039
• Carmichael numbers k such that k-1 is a Novak-Carmichael number.at n=11A375322