62745

Appears in sequences

• Carmichael numbers: composite numbers k such that a^(k-1) == 1 (mod k) for every a coprime to k.at n=13A002997
• Composite numbers k such that k == +-1 (mod 8) and 2^((k-1)/2) == 1 (mod k).at n=24A006971
• Strong pseudoprimes to base 44.at n=36A020270
• Euler-Jacobi pseudoprimes: 2^((n-1)/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol.at n=27A047713
• Carmichael numbers with exactly 4 prime factors.at n=1A074379
• Sarrus numbers with more than 2 distinct prime factors.at n=33A080747
• Pseudoprimes to bases 2 and 7.at n=9A083733
• Carmichael numbers that are not == 1 mod 24.at n=5A097130
• Pseudotwinprimes p+2 for primes p such that p+2 divides p^(p+2)+2 and p+2 is composite.at n=23A100873
• Devaraj numbers: squarefree r-prime-factor (r>1) integers N=p1*...*pr such that phi(N)=(p1-1)*...*(pr-1) divides gcd(p1-1,...,pr-1)^2*(N-1)^(r-2).at n=15A104016
• Carmichael numbers that are not == 1 mod 12. There are 69 Carmichael numbers out to 2*m+1, m=2*10^6 and all but the above 9 are 1 mod 12.at n=3A110889
• Pseudoprimes (base-2) equal to product of 4 primes not necessarily distinct.at n=6A112441
• a(n) is the smallest Carmichael number (A002997) divisible by the n-th prime, or 0 if no such number exists.at n=22A135721
• a(n) is the smallest Carmichael number (A002997) divisible by the n-th prime, or 0 if no such number exists.at n=13A135721
• Carmichael numbers with more than 3 prime factors.at n=1A141711
• Coefficients in the expansion of C^4/B^5, in Watson's notation of page 118.at n=11A160528
• Odd composite squarefree numbers k such that r = 2*(p - 2 + k/p)/(p-1) is an integer for each prime divisor p of k.at n=35A180248
• Odd composite numbers m for which A000111(m) == (-1)^( (m-1)/2 ) (mod m).at n=18A180942
• Carmichael numbers not congruent to 1 modulo 6.at n=2A205947
• 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=31A210993