93961

Appears in sequences

• Site percolation series for square lattice.at n=24A006731
• Strong pseudoprimes to base 48.at n=33A020274
• Strong pseudoprimes to base 50.at n=25A020276
• Strong pseudoprimes to base 51.at n=34A020277
• Strong pseudoprimes to base 78.at n=29A020304
• Pseudoprimes to both base 2 and base 3, i.e., intersection of A001567 and A005935.at n=22A052155
• Largest n-digit pseudoprime (to base 2).at n=2A067845
• Triangular numbers with sum of digits = 28.at n=29A068132
• a(n) = smallest triangular number having no digit in common with the previous term, with a(1) = 1.at n=32A068818
• Sarrus numbers n (A001567) which satisfy mu(n) = -1 and which are not Super-Poulet numbers (A050217).at n=33A074380
• Triangular numbers which are one more than a product of distinct triangular numbers.at n=32A083517
• Triangular numbers equal to the sum of a prime number with its index.at n=32A115886
• Triangular numbers that are the difference of nonnegative cubes.at n=13A129965
• Composite numbers k such that 2^k-2 and 3^k-3 are both divisible by k and k is not a Carmichael number (A002997).at n=8A153513
• Composite numbers n with the property that phi(n) divides (n-1)^2.at n=19A173703
• Increasing gaps between 2-pseudoprimes (lower end).at n=13A175736
• Numbers m such that exactly half of the a such that 0<a<m and (a,m)=1 satisfy a^(m-1) == 1 (mod m).at n=21A191311
• Numbers in A191311 but not in A129521.at n=9A191592
• Poulet numbers (2-pseudoprimes) of the form 7200*n^2 + 8820*n + 2701.at n=3A214016
• Fermat pseudoprimes to base 2 with three prime factors.at n=33A215672