4335241

Appears in sequences

• Carmichael numbers which are also base-2 strong pseudoprimes.at n=7A063847
• Strong pseudoprimes (base-2) equal to product of 3 primes not necessarily distinct.at n=15A112450
• Carmichael numbers of the form C = (30n-7)*(90n-23)*(300n-79).at n=1A182132
• Carmichael numbers k such that the odd part of k-1 is squarefree.at n=10A263403
• Composite numbers n such that gcd(phi(n), n-1) = lambda(n), where lambda(n) = A002322(n).at n=27A264012
• Carmichael numbers (A002997) that are the sum of two squares.at n=20A265237
• Primary Carmichael numbers.at n=13A324316
• a(n) is the smallest Carmichael number k such that gpf(p-1) = prime(n) for all prime factors p of k.at n=4A327787
• 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=8A328935
• Smallest n-bit Carmichael number, or 0 if no such number exists.at n=13A375875