137438953471
domain: N
Appears in sequences
- Mersenne numbers: 2^p - 1, where p is prime.at n=11A001348
- Mersenne numbers with at most 2 prime factors.at n=10A006515
- Cyclotomic polynomials at x=2.at n=37A019320
- Smallest number x > 1 such that phi(x) + sigma(x) = k*d(x)^n, i.e., the left-hand side is divisible by the n-th power of the number of divisors.at n=16A055470
- Smallest number x > 1 such that phi(x) + sigma(x) = k*d(x)^n, i.e., the left-hand side is divisible by the n-th power of the number of divisors.at n=17A055470
- Smallest number x > 1 such that phi(x) + sigma(x) = k*d(x)^n, i.e., the left-hand side is divisible by the n-th power of the number of divisors.at n=18A055470
- a(n) = (2^A000959(n)) - 1.at n=10A061744
- Positions of nonzero coefficients in cyclotomic polynomial Phi_n(x), converted from binary to decimal.at n=37A063670
- Positions of positive coefficients in cyclotomic polynomial Phi_n(x), converted from binary to decimal.at n=37A063696
- Zsigmondy numbers for a = 2, b = 1: Zs(n, 2, 1) is the greatest divisor of 2^n - 1 (A000225) that is coprime to 2^m - 1 for all positive integers m < n.at n=36A064078
- A multiplicative version of 2^n - 1 (A000225).at n=36A064084
- Mersenne composites: 2^prime(m) - 1 is not a prime.at n=3A065341
- Sum of terms in row n of A081532.at n=36A081533
- a(n) = 2*4^n - 1.at n=18A083420
- 2^n+(-2)^n-(-1)^n.at n=36A084181
- Smallest base-2 Fermat pseudoprime x that has ord(2,x) = n, or 0 if one does not exist.at n=36A086250
- "Mersenne" semiprimes, semiprimes of the form 2^k-1.at n=4A092561
- Mersenne numbers for which the product of the digits is not zero.at n=25A117060
- a(n) is the maximal overpseudoprime q to base 2 such that the multiplicative order of 2 mod q equals A143584(n).at n=7A131952
- Mersenne composites (A065341) with exactly 2 prime factors.at n=2A135976