8589934591
domain: N
Appears in sequences
- a(n) = 2^n - 1. (Sometimes called Mersenne numbers, although that name is usually reserved for A001348.)at n=33A000225
- Divisors of 2^33 - 1.at n=15A003540
- Jacobsthal-Lucas numbers.at n=33A014551
- a(n) = 8^n - 1.at n=11A024088
- Numbers that are both lucky numbers (A000959) and of form 2^k-1 (A000225).at n=18A057613
- a(n) = (2^A000959(n)) - 1.at n=9A061744
- Squarefree part of 2^n-1 : the smallest number such that a(n)*(2^n-1) is a square.at n=32A069112
- Number of irreducible indecomposable permutations of degree n.at n=34A078485
- a(n) = 2*4^n - 1.at n=16A083420
- 2^n+(-2)^n-(-1)^n.at n=32A084181
- Partial sums of a Jacobsthal related sequence.at n=33A084184
- Start with the sequence [1, 1/2, 1/3, ..., 1/n]; form new sequence of n-1 terms by taking averages of successive terms; repeat until reach a single number F(n); a(n) = numerator of F(n).at n=32A090633
- Reduced numerators of 2*(2^(1+n)-1)/(1+n)/(2+n).at n=32A116419
- Mersenne numbers for which the product of the digits is not zero.at n=21A117060
- Numbers n such that n == -1 (mod phi(n-1)).at n=12A119388
- Nonprime numbers of the form 2^n - 1.at n=25A135972
- 2^(n-th semiprime) - 1.at n=10A138104
- 2^(2p - 1) - 1, where p is prime.at n=6A139287
- a(n) = (2^(2*p - 1)) - 1, where p is A000043(n).at n=5A139307
- First differences of A140322.at n=16A140323