This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A071151 #25 Dec 24 2024 22:12:17
%S A071151 3,127,379,499,6079,6599,8273,9521,11597,13099,22037,33623,34913,
%T A071151 49279,52517,54167,64613,92951,101999,116531,182107,222269,225829,
%U A071151 240379,255443,283079,356387,360977,448867,535669,541339,552751,611953,624209
%N A071151 Primes which are the sum of the first k odd primes for some k.
%H A071151 T. D. Noe, <a href="/A071151/b071151.txt">Table of n, a(n) for n = 1..1000</a>
%t A071151 s=0;lst={};Do[p=Prime[n];s+=p;If[PrimeQ[s],AppendTo[lst,s]],{n,2,7!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Jan 28 2009 *)
%t A071151 Select[Accumulate[Prime[Range[2,500]]],PrimeQ] (* _Harvey P. Dale_, Mar 14 2011 *)
%o A071151 (PARI) list(lim)=my(v=List(),s); forprime(p=3,, if((s+=p)>lim, return(Vec(v))); if(isprime(s), listput(v,s))) \\ _Charles R Greathouse IV_, May 22 2017
%o A071151 (Python)
%o A071151 from sympy import isprime, nextprime; m = 0; p = 2
%o A071151 while p < 3100:
%o A071151 p = nextprime(p); m += p
%o A071151 if isprime(m): print(m, end = ', ') # _Ya-Ping Lu_, Dec 24 2024
%Y A071151 Analogous to A013918.
%Y A071151 Cf. A013916-A013918, A065091, A071148-A071150, A007504.
%K A071151 nonn
%O A071151 1,1
%A A071151 _Labos Elemer_, May 13 2002
%E A071151 Name simplified by _Charles R Greathouse IV_, May 22 2017