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 #28 Sep 15 2018 18:38:19
%S 151,229,313,373,401,433,467,659,691,977,1051,1283,1361,1597,1787,
%T 1867,1987,2339,3023,3067,3187,4051,4091,4129,4337,4373,4723,5009,
%U 5209,5419,5647,5849,5897,6269,6329,6473,6971,7243,7643,7853,8017,8287,8501,8609,8669
%N Primes that are the sum of 7 alternate primes.
%C Equivalently, primes p such that there exists k such that p = prime(k) + prime(k+2) + prime(k+4) + prime(k+6) + prime(k+8) + prime(k+10) + prime(k+12).
%H Muniru A Asiru, <a href="/A300394/b300394.txt">Table of n, a(n) for n = 1..5000</a>
%e 151 = 3 + 7 + 13 + 19 + 29 + 37 + 43 is a prime and 3, 7, 13, 19, 29, 37, 43 are alternate primes.
%e 229 = 11 + 17 + 23 + 31 + 41 + 47 + 59 is a prime and 11, 17, 23, 31, 41, 47, 59 are alternate primes.
%p select(isprime,[seq(sum(ithprime(2*i+k),i=0..6),k=1..210)]);
%o (GAP) P:=Filtered([1..10000],IsPrime);;
%o Filtered(List([1..210],k->Sum([0..6],i->P[2*i+k])),IsPrime);
%Y Cf. Primes that are the sum of k alternate primes: A068363 (k=3), A068364 (k=5), this sequence (k=7), A300395 (k=9).
%K nonn
%O 1,1
%A _Muniru A Asiru_, Mar 05 2018