This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A225947 Lexicographically least sequence of primes (including 1) that are sum-free. 2
 1, 2, 5, 11, 23, 43, 47, 137, 157, 293, 439, 1163, 1201, 2339, 3529, 5867, 9391, 23623, 24659, 49477, 72953, 147083, 195511, 392059, 538001, 1052479, 1590467, 2520503, 4503007, 5041007, 14047027, 15637483, 28239989, 55404001, 115994933, 210773399 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A sum-free sequence has no term that is the sum of a subset of its previous terms. There are an infinite number of sequences that are subsets of {1} union primes and sum-free. This sequence is lexicographically the first. LINKS Giovanni Resta, Table of n, a(n) for n = 1..40 H. L. Abbott, On sum-free sequences, Acta Arithmetica, 1987, Vol 48, Issue 1, pp. 93-96. C. Rivera, Prime Puzzle 127 Eric W. Weisstein, A-Sequence (MathWorld) Wikipedia, Sum-free sequence EXAMPLE a(8)=137 as 137 is the next prime after a(7)=47 that cannot be formed from distinct sums of a(1),...,a(7) (1,2,5,11,23,43,47). MATHEMATICA memberQ[n1_, k1_] := If[Select[IntegerPartitions[Prime[n1], Length[k1], k1], Sort@#==Union@# &]=={}, False, True]; k={1}; n=1; While[Length[k]<15, (If[!memberQ[n, k], k=Append[k, Prime[n]]]; n++)]; k CROSSREFS Cf. A060341, A064934, A075058. Sequence in context: A294938 A062475 A186265 * A281969 A124920 A064934 Adjacent sequences:  A225944 A225945 A225946 * A225948 A225949 A225950 KEYWORD nonn AUTHOR Frank M Jackson, May 21 2013 EXTENSIONS a(23) - a(32) from Zak Seidov, May 23 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 26 20:37 EDT 2019. Contains 321534 sequences. (Running on oeis4.)