Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Mar 03 2016 02:24:21
%S 9,13,17,21,37,41,45,65,69,93,133,137,141,161,165,189,257,261,285,381,
%T 8197,8201,8205,8225,8229,8253,8321,8325,8349,8445,16385,16389,16413,
%U 16509,24573,131077,131081,131085,131105,131109,131133,131201,131205,131229,131325,139265,139269,139293,139389,147453,262145,262149
%N Sums of three Mersenne primes.
%H Robert Israel, <a href="/A174055/b174055.txt">Table of n, a(n) for n = 1..969</a>
%F A000668(i) + A000668(j) + A000668(k), with integers i,j,k not necessarily distinct. The subsequence of prime sums of three Mersenne primes is A174056.
%e a(1) = 3 + 3 + 3 = 9. a(2) = 3 + 3 + 7 = 13. a(3) = 3 + 7 + 7 = 17. a(4) = 7 + 7 + 7 = 21. a(5) = 3 + 3 + 31 = 37. a(6) = 3 + 7 + 31 = 41.
%p N:= 10^6: # to get all terms <= N
%p for n from 1 while numtheory:-mersenne([n]) < N do od:
%p S:= {seq(numtheory:-mersenne([i]),i=1..n-1)}:
%p sort(convert(select(`<=`,{seq(seq(seq(s+t+u,s=S),t=S),u=S)},N),list)); # _Robert Israel_, Mar 02 2016
%Y Cf. A000668, A155877, A166484, A171251, A171252, A171253, A171254, A171255, A174056, A174057.
%K nonn
%O 1,1
%A _Jonathan Vos Post_, Mar 06 2010
%E More terms from _Max Alekseyev_, Oct 15 2012
%E Edited by _Robert Israel_, Mar 02 2016