2147483647
domain: N
Appears in sequences
- a(n) = 2^n - 1. (Sometimes called Mersenne numbers, although that name is usually reserved for A001348.)at n=31A000225
- Mersenne primes (primes of the form 2^n - 1).at n=7A000668
- Mersenne numbers: 2^p - 1, where p is prime.at n=10A001348
- a(n) = least primitive factor of 2^(2n+1) - 1.at n=15A002184
- a(n) = largest noncomposite factor of 2^(2n+1) - 1.at n=15A002588
- Numerators of the Taylor coefficients of (e^x-1)^2.at n=30A002678
- Largest prime factor of n-th Mersenne number (A001348(n)).at n=10A003260
- Largest prime factor of 2^n - 1.at n=29A005420
- Mersenne numbers with at most 2 prime factors.at n=9A006515
- Numbers k such that k and k+1 are prime powers.at n=14A006549
- Stirling numbers of second kind S2(32,n).at n=1A011581
- Largest prime <= 2^n.at n=30A014234
- Jacobsthal-Lucas numbers.at n=31A014551
- Smallest prime factor of Mersenne numbers 2^p-1, where p is prime.at n=10A016047
- Cyclotomic polynomials at x=2.at n=31A019320
- Smallest prime dividing 2^n - 1.at n=29A049479
- Sum of divisors of n, sigma(n) (A000203), is a power of number of divisors of n, d(n) (A000005).at n=31A051281
- Cototient of 2^n - 1.at n=31A053288
- Scan decimal expansion of Mersenne primes (A000668), recording all primes seen.at n=18A053648
- Smallest prime with Hamming weight n (i.e., with exactly n 1's when written in binary).at n=30A061712