115921

Appears in sequences

• Carmichael numbers: composite numbers k such that a^(k-1) == 1 (mod k) for every a coprime to k.at n=17A002997
• Composite numbers k such that k == +-1 (mod 8) and 2^((k-1)/2) == 1 (mod k).at n=32A006971
• Strong pseudoprimes to base 6.at n=31A020232
• Strong pseudoprimes to base 60.at n=32A020286
• Strong pseudoprimes to base 96.at n=34A020322
• Strong pseudoprimes to base 97.at n=34A020323
• Pseudoprimes to both base 2 and base 3, i.e., intersection of A001567 and A005935.at n=26A052155
• z-value of the solution (x,y,z) to 3/(2n+1) = 1/x + 1/y + 1/z satisfying 0 < x < y < z, odd x, y, z and having the largest z-value. The x and y components are in A075260 and A075261.at n=16A075262
• Smallest triangular number which is one more than the product of n distinct numbers > 1.at n=6A081951
• Triangular numbers whose sum of aliquot divisors is a prime number.at n=38A083676
• Pseudoprimes to bases 2 and 5.at n=18A083732
• Pseudoprimes to bases 2 and 7.at n=12A083733
• Pseudoprimes to bases 3 and 5.at n=16A083734
• Pseudoprimes to bases 3 and 7.at n=14A083735
• Pseudoprimes to bases 2,5 and 7.at n=4A083736
• Pseudoprimes to bases 2, 3 and 5.at n=12A083737
• Pseudoprimes to bases 2,3 and 7.at n=8A083738
• Pseudoprimes to bases 2, 3, 5 and 7.at n=3A083739
• Pseudoprimes to bases 3,5 and 7.at n=4A083740
• 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=12A087788