75361

Appears in sequences

• Carmichael numbers: composite numbers k such that a^(k-1) == 1 (mod k) for every a coprime to k.at n=15A002997
• Composite numbers k such that k == +-1 (mod 8) and 2^((k-1)/2) == 1 (mod k).at n=27A006971
• Absolute Euler pseudoprimes: odd composite numbers n such that a^((n-1)/2) == +-1 (mod n) for every a coprime to n.at n=5A033181
• Euler-Jacobi pseudoprimes: 2^((n-1)/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol.at n=30A047713
• Base-3 Euler-Jacobi pseudoprimes.at n=32A048950
• a(n) = Product_{d|n, d^2<=n} (d+n/d); a(1)=1.at n=29A050214
• Pseudoprimes to both base 2 and base 3, i.e., intersection of A001567 and A005935.at n=17A052155
• Largest n-digit Carmichael numbers.at n=2A063400
• Carmichael numbers with exactly 4 prime factors.at n=3A074379
• Sarrus numbers with more than 2 distinct prime factors.at n=38A080747
• Pseudoprimes to bases 2 and 5.at n=15A083732
• Pseudoprimes to bases 2 and 7.at n=10A083733
• Pseudoprimes to bases 3 and 5.at n=12A083734
• Pseudoprimes to bases 3 and 7.at n=10A083735
• Pseudoprimes to bases 2,5 and 7.at n=3A083736
• Pseudoprimes to bases 2, 3 and 5.at n=10A083737
• Pseudoprimes to bases 2,3 and 7.at n=6A083738
• Pseudoprimes to bases 2, 3, 5 and 7.at n=2A083739
• Pseudoprimes to bases 3,5 and 7.at n=2A083740
• Carmichael numbers C such that C-1 is not a Niven/Harshad number.at n=2A097061