OFFSET
1,1
COMMENTS
Prime cumulative sum of primes p such that 2^p - 1 is a Mersenne prime include: a(1) = 2, a(2) = 5, a(4) = 17, a(6) = 47, a(8) = 97, a(14) = 1609, a(18) = 10589. After 1, all such indices x of prime a(x) must be even.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..48 (terms 1..47 from Gord Palameta)
FORMULA
a(n) = Sum_{i=1..n} A000043(i).
EXAMPLE
a(1) = 2, since 2^2-1 = 3 is a Mersenne prime.
a(2) = 2 + 3 = 5, since 2^3-1 = 7 is a Mersenne prime.
a(3) = 2 + 3 + 5 = 10, since 2^5-1 = 31 is a Mersenne prime.
a(4) = 2 + 3 + 5 + 7 = 17, since 2^7-1 = 127 is a Mersenne prime; 17 itself is prime (in fact a p such that 2^p-1 is a Mersenne prime).
a(18) = 2 + 3 + 5 + 7 + 13 + 17 + 19 + 31 + 61 + 89 + 107 + 127 + 521 + 607 + 1279 + 2203 + 2281 + 3217 = 10589 (which is prime).
MATHEMATICA
Accumulate[Select[Range[3000], PrimeQ[2^# - 1] &]] (* Vladimir Joseph Stephan Orlovsky, Jul 08 2011 *)
Accumulate@ MersennePrimeExponent@ Range@ 45 (* Michael De Vlieger, Jul 22 2018 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Jonathan Vos Post, Aug 28 2005
EXTENSIONS
a(38)-a(47) from Gord Palameta, Jul 21 2018
STATUS
approved