410041

Appears in sequences

• Carmichael numbers: composite numbers k such that a^(k-1) == 1 (mod k) for every a coprime to k.at n=29A002997
• Pseudoprimes to bases 2 and 5.at n=31A083732
• Pseudoprimes to bases 2 and 7.at n=23A083733
• Pseudoprimes to bases 3 and 5.at n=30A083734
• Pseudoprimes to bases 3 and 7.at n=31A083735
• Pseudoprimes to bases 2,5 and 7.at n=12A083736
• Pseudoprimes to bases 2, 3 and 5.at n=23A083737
• Pseudoprimes to bases 2,3 and 7.at n=18A083738
• Pseudoprimes to bases 2, 3, 5 and 7.at n=11A083739
• Pseudoprimes to bases 3,5 and 7.at n=13A083740
• 3-Carmichael numbers: Carmichael numbers equal to the product of 3 primes: k = p*q*r, where p < q < r are primes such that a^(k-1) == 1 (mod k) if a is prime to k.at n=19A087788
• Records in A098650.at n=14A098652
• 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=33A104016
• a(n) is the smallest Carmichael number (A002997) divisible by the n-th prime, or 0 if no such number exists.at n=31A135721
• Carmichael numbers that only have composite XOR couples as defined in A182108.at n=0A182116
• Intersection of A001567 and A212502.at n=17A212601
• Carmichael numbers whose prime factors all have the form p=1+x^2+y^2 for some x,y in Z.at n=2A258839
• Carmichael numbers (A002997) that are not absolute Euler pseudoprimes (A033181).at n=20A262043
• Composite numbers n such that gcd(phi(n), n-1) = lambda(n), where lambda(n) = A002322(n).at n=16A264012
• Carmichael numbers (A002997) that are the sum of two squares.at n=11A265237