OFFSET
1,1
COMMENTS
Also, a(n) is equal to the number of bits in A135650(n), the n-th even perfect number written in base 2.
These are odd numbers k such that 2^((k+1)/2) - 1 is (a Mersenne) prime. - Thomas Ordowski, Apr 20 2019
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..48 (terms 1..47 from Ivan Panchenko)
Chris K. Caldwell, "Top Twenty" page, Mersenne Primes.
FORMULA
MATHEMATICA
2 * MersennePrimeExponent[Range[48]] - 1 (* Amiram Eldar, Oct 18 2024 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Omar E. Pol, Oct 27 2007, Feb 23 2008, Apr 28 2009
EXTENSIONS
a(39)-a(43) from Ivan Panchenko, Apr 12 2018
STATUS
approved