33554431
domain: N
Appears in sequences
- a(n) = 2^n - 1. (Sometimes called Mersenne numbers, although that name is usually reserved for A001348.)at n=25A000225
- Numerators of the Taylor coefficients of (e^x-1)^2.at n=24A002678
- Divisors of 2^25 - 1.at n=7A003533
- If n mod 4 = 0 then 2^(n-1)+1 elif n mod 4 = 2 then 2^(n-1)-1 else 2^(n-1).at n=25A007679
- Stirling numbers of second kind S2(26,n).at n=1A011575
- Jacobsthal-Lucas numbers.at n=25A014551
- Number of moves needed to solve an (n+1)-ring baguenaudier if two simultaneous moves of the two end rings are counted as one.at n=25A051049
- Numbers that are both lucky numbers (A000959) and of form 2^k-1 (A000225).at n=16A057613
- Number of points of period n under the dual of the map x->2x on Z[1/6].at n=24A059990
- a(n) = (2^A000959(n)) - 1.at n=7A061744
- a(n) = 2*n^n-1.at n=8A062207
- Sum of the divisors of n^n (A000312).at n=8A062727
- A multiplicative version of 2^n - 1 (A000225).at n=24A064084
- Binary string self-substitutions: a(n) is obtained by substituting the binary expansion of n for each 1-bit in the binary expansion of n.at n=31A065159
- Squarefree part of 2^n-1 : the smallest number such that a(n)*(2^n-1) is a square.at n=24A069112
- Position of A014486(n) in A075165, minus one.at n=54A075162
- Expansion of (1-x)^(-1)/(1+x-2*x^2-2*x^3).at n=48A077896
- Number of irreducible indecomposable permutations of degree n.at n=26A078485
- a(n) = 2*4^n - 1.at n=12A083420
- 2^n+(-2)^n-(-1)^n.at n=24A084181