A067372 Integers expressible as the sum of (at least two) consecutive primes in at least 2 ways.

36, 41, 60, 72, 83, 90, 100, 112, 119, 120, 138, 143, 152, 180, 187, 197, 199, 204, 210, 221, 223, 228, 240, 251, 258, 276, 281, 287, 300, 304, 311, 323, 330, 340, 371, 372, 384, 390, 395, 401, 408, 410, 434, 439, 456, 462, 473, 480, 491, 492, 508, 510, 533

Offset

1,1

Links

David A. Corneth, Table of n, a(n) for n = 1..10841 (terms <= 10^5, first 1000 terms from Donovan Johnson)

P. De Geest, WONplate 122

C. Rivera, Puzzle 46

Eric Weisstein's World of Mathematics, Prime Sums

Formula

A084143(a(n)) > 1. - Ray Chandler, Sep 20 2023

Example

36 = (17 + 19) = (5 + 7 + 11 + 13) or (#2,17) (#4,5).

Mathematica

m=5!; lst={}; Do[p=Prime[a]; Do[p+=Prime[b]; If[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]], AppendTo[lst, lst1[[n]]]], {n, Length[lst1]-1}]; Union[lst] (* Vladimir Joseph Stephan Orlovsky, Aug 15 2009 *)

Prog

(PARI) upto(n) = {my(s = 0, pr = List([0]), l = List(), res = List()); forprime(p = 2, n + 100, s+=p; listput(pr, s) ); for(i = 3, #pr, for(j = 2, i-1, if(pr[i] - pr[i-j] <= n, listput(l, pr[i] - pr[i-j]) , next(2) ) ) ); listsort(l); for(i = 2, #l, if(l[i-1] == l[i], listput(res, l[i]) ) ); Set(res); } \\ David A. Corneth, Aug 22 2019

Crossrefs

Cf. A050936, A067372-A067381, A054997.

Sequence in context: A295694 A295492 A225103 * A084147 A261258 A261372

Adjacent sequences: A067369 A067370 A067371 * A067373 A067374 A067375

Keyword

nonn,easy

Author

Patrick De Geest, Feb 04 2002

Extensions

Offset corrected by Donovan Johnson, Nov 14 2013

Status

approved