42799

Appears in sequences

• Strong pseudoprimes to base 2.at n=7A001262
• Numerators of the Taylor coefficients of (e^x-1)^2.at n=20A002678
• Divisors of 2^21 - 1.at n=9A003530
• Euler pseudoprimes: composite numbers n such that 2^((n-1)/2) == +-1 (mod n).at n=28A006970
• Composite numbers k such that k == +-1 (mod 8) and 2^((k-1)/2) == 1 (mod k).at n=21A006971
• Strong pseudoprimes to base 4.at n=18A020230
• Strong pseudoprimes to base 8.at n=21A020234
• Strong pseudoprimes to base 32.at n=38A020258
• Euler-Jacobi pseudoprimes: 2^((n-1)/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol.at n=23A047713
• Super-Poulet numbers: Poulet numbers whose divisors d all satisfy d|2^d-2.at n=22A050217
• A051851(n)/row_index_of(n).at n=43A051852
• a(n) = (n^(n-1)-1)/(n-1)^2.at n=6A060073
• Nearest integer to n^7/49.at n=7A061532
• Squarefree part of 2^n-1 : the smallest number such that a(n)*(2^n-1) is a square.at n=20A069112
• Smallest base-2 Fermat pseudoprime x that has ord(2,x) = n, or 0 if one does not exist.at n=20A086250
• Brilliant Sarrus numbers.at n=5A086837
• Pseudotwinprimes p+2 for primes p such that p+2 divides p^(p+2)+2 and p+2 is composite.at n=19A100873
• Arithmetic mean of row n in A112668.at n=6A110739
• Quotients ((p+1)^p - 1)/p^2 for p = prime(n).at n=3A137665
• a(n) = (2^A002326(n)-1)/(2*n+1).at n=24A165781