OFFSET
1,1
COMMENTS
Sum of the first k primes p_1+p_2+...+p_k is in the sequence if and only if there exists the prime q for which p_i divides p_1+p_2+...+p_k+q for all i to k. - Vladimir Letsko, Oct 13 2013
LINKS
T. D. Noe, Table of n, a(n) for n = 1..10000
Vladimir Letsko, Mathematical Marathon, problem 124 (in Russian).
Romeo Meštrović, Curious conjectures on the distribution of primes among the sums of the first 2n primes, arXiv:1804.04198 [math.NT], 2018.
MATHEMATICA
Select[Accumulate[Prime[Range[1000]]], PrimeQ] (* Vladimir Joseph Stephan Orlovsky, Sep 01 2008 *)
PROG
(PARI) n=0; forprime(k=2, 2300, n=n+k; if(isprime(n), print(n))) \\ Michael B. Porter, Jan 29 2010
(Haskell)
a013918 n = a013918_list !! (n-1)
a013918_list = filter ((== 1) . a010051) a007504_list
-- Reinhard Zumkeller, Feb 09 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Renaud Lifchitz (100637.64(AT)CompuServe.COM)
EXTENSIONS
More terms from David W. Wilson
STATUS
approved