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.
5 can be represented (in just one way) as 2+3.
a(1) = 34421 = Sum_{i=57..127} prime(i) = Sum_{i=226..248} prime(i) = Sum_{i=527..535} prime(i) = Sum_{i=654..660} prime(i) = Sum_{i=1382..1384} prime(i) and
a(3) = 235493 = Sum_{i=50..284} prime(i) = Sum_{i=120..300} prime(i) = Sum_{i=123..301} prime(i) = Sum_{i=334..424} prime(i) = Sum_{i=7701..7703} prime(i)
are expressible in 5 ways as the sum of two or more consecutive primes.
M:=1695000; P:=PrimesUpTo(M); S:=[0]; for p in P do t:=S[#S]+p; if #S ge 3 then if t-S[#S-2] gt M then break; end if; end if; S[#S+1]:=t;end for; c:=[0:j in [1..M]]; for C in [2..#S-1] do if IsEven(C) then L:=1; else L:=#S-C; end if; for j in [1..L] do s:=S[j+C]-S[j]; if s gt M then break; end if; if IsPrime(s) then c[s]+:=1; end if; end for; end for; [j:j in [1..M]|c[j] ge 5]; // Jon E. Schoenfield, Dec 25 2021
m=3*7!;lst={};Do[p=Prime[a];Do[p+=Prime[b];If[PrimeQ[p]&&p
442019 is a term because it is a prime and
442019 = Sum_{j=13620..13622} prime(j)
= Sum_{j=5044..5052} prime(j)
= Sum_{j=2019..2043} prime(j)
= Sum_{j=1573..1605} prime(j)
= Sum_{j=954..1010} prime(j)
= Sum_{j=81..381} prime(j).
3634531 is a term because it is a prime and
3634531 = Sum_{j=42997..43003} prime(j)
= Sum_{j=15749..15769} prime(j)
= Sum_{j=7294..7342} prime(j)
= Sum_{j=7032..7082} prime(j)
= Sum_{j=3397..3509} prime(j)
= Sum_{j=165..1003} prime(j)
= Sum_{j=65..995} prime(j).
Comments