825265

Appears in sequences

• Least Carmichael number with n prime factors, or 0 if no such number exists.at n=2A006931
• a(n) = smallest pseudoprime to base 2 with n prime factors.at n=3A007011
• Carmichael numbers C such that C-1 is not a Niven/Harshad number.at n=6A097061
• Carmichael numbers equal to the product of 5 primes.at n=0A112428
• Pseudoprimes (base-2) equal to the product of 5 primes not necessarily distinct.at n=0A112443
• Carmichael numbers with more than 3 prime factors.at n=16A141711
• Carmichael numbers divisible by 7.at n=14A182208
• Carmichael numbers divisible by 7 and 17.at n=0A182532
• Pseudoprimes divisible by a smaller pseudoprime.at n=33A215150
• Fermat pseudoprimes to base 2 divisible by 5.at n=31A216023
• a(n) = F(n+7) - (1/2)*(n^3+2*n^2+13*n+26) where F(i) is a Fibonacci number (A000045).at n=23A220888
• Least Carmichael number that is divisible by the n-th cyclic number A003277(n), or 0 if no such number exists.at n=12A253595
• Carmichael numbers (A002997) that are not absolute Euler pseudoprimes (A033181).at n=25A262043
• Composite numbers n such that gcd(phi(n), n-1) = lambda(n), where lambda(n) = A002322(n).at n=20A264012
• Square array A(n, k) read by antidiagonals downwards: smallest base-n Fermat pseudoprime with k distinct prime factors for k, n >= 2.at n=6A271873
• Square array A(n, k) read by antidiagonals downwards: smallest base-n Fermat pseudoprime with k distinct prime factors for k, n >= 2.at n=11A271873
• Carmichael numbers m having a Fermat prime (A019434) factor such that A002322(m) = 2^k * p^2, where k is an integer and p is an odd prime.at n=0A293291
• a(n) is the smallest k with n prime factors such that p^k == p (mod k) for every prime p dividing k.at n=4A294179
• Carmichael numbers m such that A309132(m) < m.at n=6A309268
• Carmichael numbers k for which A053575(k) [the odd part of phi] does not divide k-1.at n=28A340092