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 A067379 #20 Sep 26 2023 09:05:59
%S A067379 311,863,1151,1367,1951,2393,2647,2689,3389,4957,5059,5153,7451,7901,
%T A067379 8819,10499,10859,10949,12329,12641,12713,13127,13297,14369,14699,
%U A067379 14759,14951,15091,15329,15527,16223,16249,16829,18089,18311,18401
%N A067379 Primes expressible as the sum of (at least two) consecutive primes in at least 3 ways.
%H A067379 Jon E. Schoenfield, <a href="/A067379/b067379.txt">Table of n, a(n) for n = 1..10000</a>
%H A067379 Patrick De Geest, <a href="http://www.worldofnumbers.com/em122.htm">WON plate 122</a>
%H A067379 Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_046.htm">Puzzle 46. Primes expressible as sum of consecutive primes in K ways</a>, The Prime Puzzles and Problems Connection.
%F A067379 Prime(n) such that A307610(n) > 3. - _Ray Chandler_, Sep 21 2023
%t A067379 m=2*6!; lst={}; Do[p=Prime[a]; Do[p+=Prime[b]; If[PrimeQ[p]&&p<Prime[m]*3+8,AppendTo[lst,p]],{b,a+1,m,1}],{a,m}]; lst1=Sort[lst]; lst={}; Do[If[lst1[[n]]==lst1[[n+1]]&&lst1[[n]]==lst1[[n+2]],AppendTo[lst,lst1[[n]]]],{n,Length[lst1]-2}]; Union[lst] (* _Vladimir Joseph Stephan Orlovsky_, Aug 15 2009 *)
%Y A067379 Cf. A050936, A067372-A067381, A307610.
%K A067379 nonn
%O A067379 1,1
%A A067379 _Patrick De Geest_, Feb 04 2002