4294967295

Appears in sequences

• a(n) = 2^n - 1. (Sometimes called Mersenne numbers, although that name is usually reserved for A001348.)at n=32A000225
• Sierpiński's triangle (Pascal's triangle mod 2) converted to decimal.at n=31A001317
• Divisors of 2^32 - 1 (for a(1) to a(31), the 31 regular polygons with an odd number of sides constructible with ruler and compass).at n=31A004729
• 2^(2^n) +- 1 without repeats.at n=9A016043
• Numbers n such that sigma(phi(n)) = n.at n=20A018784
• a(n) = 4^n - 1.at n=16A024036
• Bisection of A001317.at n=15A038192
• Odd values of n for which a regular n-gon can be constructed by compass and straightedge.at n=30A045544
• a(n) = T(2, n), where T is the array given by A047858.at n=28A047859
• Solutions to 2*phi(x) = x+1.at n=6A050474
• a(n) = 2^(2^n) - 1.at n=5A051179
• Smallest number whose Euler totient is divisible by 2^n.at n=31A053576
• a(n) is the position of A050614(n) in A062877.at n=31A062878
• A multiplicative version of 2^n - 1 (A000225).at n=31A064084
• a(n) = n^phi(n) - 1.at n=15A066916
• Numbers k such that sigma(phi(k)) == 0 (mod k).at n=25A067144
• Squarefree part of 2^n-1 : the smallest number such that a(n)*(2^n-1) is a square.at n=31A069112
• Number of irreducible indecomposable permutations of degree n.at n=33A078485
• Jacobsthal gap sequence.at n=32A080924
• 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=31A090633