1073741823

Appears in sequences

• a(n) = 2^n - 1. (Sometimes called Mersenne numbers, although that name is usually reserved for A001348.)at n=30A000225
• Number of 2n-bead balanced binary necklaces of fundamental period 2n, equivalent to reversed complement; also Dirichlet convolution of b_n=2^(n-1) with mu(n); also number of components of Mandelbrot set corresponding to Julia sets with an attractive n-cycle.at n=30A000740
• Stirling numbers of second kind S2(31,n).at n=1A011580
• Number of Barlow packings with group P63/mmc(S) that repeat after 4n layers.at n=30A011946
• a(n) = 4^n - 1.at n=15A024036
• a(n) = 8^n - 1.at n=10A024088
• a(n) = Sum_{1<=k<=n, gcd(k,n)=1} 2^(k-1).at n=30A054432
• Largest number that has the same number of digits in base 10 and base n, or 0 if no such number exists.at n=6A055866
• Number of primitive (aperiodic) word structures of length n which contain exactly two different symbols.at n=30A056278
• a(n) = phi(2^n - 1)/2.at n=29A056742
• a(n) = 2^n + (-1)^(n+1).at n=30A062510
• Number of irreducible indecomposable permutations of degree n.at n=31A078485
• Jacobsthal gap sequence.at n=30A080924
• Resultant of the polynomial x^n-1 and the Chebyshev polynomial of the second kind U_2(x).at n=14A085435
• Number of steps needed to reverse a pattern of length 2*n of cellular automaton Rule 90.at n=29A086839
• Smallest k such that k^4 - 1 is divisible by an n-th power, k > 1.at n=31A088041
• Binomial transform of A088689.at n=30A088688
• Smallest composite number with exactly n 1's in binary representation.at n=29A089226
• a(n) = -A065395(2^n).at n=30A092589
• A062402(x)=sigma(phi[x]) function is iterated; initial value=2^n; a(n)=smallest term of trajectory.at n=29A097002