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.
lista(nn) = {s = 0; forprime(p=2, nn, s += p; if (isprime(s) && isprime(s-2), print1(p, ", ")););} \\ Michel Marcus, Feb 23 2015
Primes:= select(isprime, [seq(2*i+1,i=1..10^4)]): L:= ListTools:-PartialSums(Primes): select(i -> isprime(L[i]), [$1..nops(L)]); # Robert Israel, May 19 2015
Position[Accumulate@ Prime@ Range[2, 750], ?(PrimeQ@# &)] // Flatten (* _Robert G. Wilson v, May 19 2015, after Harvey P. Dale in A013916 *)
s=n=0; forprime(p=3,1e4, n++; if(isprime(s+=p), print1(n", "))) \\ Charles R Greathouse IV, May 13 2015
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 *)
Select[Accumulate[Prime[Range[2,500]]],PrimeQ] (* Harvey P. Dale, Mar 14 2011 *)
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
from sympy import isprime, nextprime; m = 0; p = 2
while p < 3100:
p = nextprime(p); m += p
if isprime(m): print(m, end = ', ') # Ya-Ping Lu, Dec 24 2024
Comments