52633

Appears in sequences

• Strong pseudoprimes to base 2.at n=9A001262
• Carmichael numbers: composite numbers k such that a^(k-1) == 1 (mod k) for every a coprime to k.at n=12A002997
• Composite numbers k such that k == +-1 (mod 8) and 2^((k-1)/2) == 1 (mod k).at n=23A006971
• Strong pseudoprimes to base 4.at n=21A020230
• Strong pseudoprimes to base 8.at n=25A020234
• Strong pseudoprimes to base 69.at n=25A020295
• Number of binary [ n,3 ] codes without 0 columns.at n=38A034344
• Euler-Jacobi pseudoprimes: 2^((n-1)/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol.at n=26A047713
• Base-3 Euler-Jacobi pseudoprimes.at n=27A048950
• Pseudoprimes to both base 2 and base 3, i.e., intersection of A001567 and A005935.at n=15A052155
• Carmichael numbers which are also base-2 strong pseudoprimes.at n=2A063847
• Sarrus numbers n (A001567) which satisfy mu(n) = -1 and which are not Super-Poulet numbers (A050217).at n=25A074380
• Sarrus numbers with more than 2 distinct prime factors.at n=30A080747
• Pseudoprimes to bases 2 and 5.at n=12A083732
• Pseudoprimes to bases 3 and 5.at n=10A083734
• Pseudoprimes to bases 2, 3 and 5.at n=8A083737
• 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=11A087788
• Pseudotwinprimes p+2 for primes p such that p+2 divides p^(p+2)+2 and p+2 is composite.at n=21A100873
• 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=14A104016
• Strong pseudoprimes (base-2) equal to product of 3 primes not necessarily distinct.at n=2A112450