# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a109472
Showing 1-1 of 1

%I A109472 #21 Aug 06 2018 05:22:03
%S A109472 2,5,10,17,30,47,66,97,158,247,354,481,1002,1609,2888,5091,7372,10589,
%T A109472 14842,19265,28954,38895,50108,70045,91746,114955,159452,245695,
%U A109472 356198,488247,704338,1461177,2320610,3578397,4976666,7952887,10974264,17946857,31413774,52409785,76446368,102411319,132813776,165396433,202553100,245196901,288309510
%N A109472 Cumulative sum of primes p such that 2^p - 1 is a Mersenne prime.
%C A109472 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.
%H A109472 Gord Palameta, <a href="/A109472/b109472.txt">Table of n, a(n) for n = 1..47</a>
%F A109472 a(n) = Sum_{i=1..n} A000043(i).
%e A109472 a(1) = 2, since 2^2-1 = 3 is a Mersenne prime.
%e A109472 a(2) = 2 + 3 = 5, since 2^3-1 = 7 is a Mersenne prime.
%e A109472 a(3) = 2 + 3 + 5 = 10, since 2^5-1 = 31 is a Mersenne prime.
%e A109472 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).
%e A109472 a(18) = 2 + 3 + 5 + 7 + 13 + 17 + 19 + 31 + 61 + 89 + 107 + 127 + 521 + 607 + 1279 + 2203 + 2281 + 3217 = 10589 (which is prime).
%t A109472 Accumulate[Select[Range[3000], PrimeQ[2^# - 1] &]] (* _Vladimir Joseph Stephan Orlovsky_, Jul 08 2011 *)
%t A109472 Accumulate@ MersennePrimeExponent@ Range@ 45 (* _Michael De Vlieger_, Jul 22 2018 *)
%Y A109472 Cf. A000043, A000668 for the Mersenne primes, A001348, A046051, A057951-A057958.
%K A109472 nonn
%O A109472 1,1
%A A109472 _Jonathan Vos Post_, Aug 28 2005
%E A109472 a(38)-a(47) from _Gord Palameta_, Jul 21 2018

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE