OFFSET
0,5
COMMENTS
a(n) = 2^n - A085489(n); a non-sum-free subset contains at least one subset {u,v, w} with w=u+v.
A variation of binary sum-full sets where parts cannot be re-used, this sequence counts subsets of {1..n} with an element equal to the sum of two distinct others. The complement is counted by A085489. The non-binary version is A364534. For re-usable parts we have A093971. - Gus Wiseman, Aug 10 2023
LINKS
Fausto A. C. Cariboni, Table of n, a(n) for n = 0..75
Eric Weisstein's World of Mathematics, Sum-Free Set
Reinhard Zumkeller, Illustration of initial terms
EXAMPLE
From Gus Wiseman, Aug 10 2023: (Start)
The set S = {1,3,6,8} has pair-sums {4,7,9,11,14}, which are all missing from S, so it is not counted under a(8).
The set {1,4,6,7} has pair-sum 1 + 6 = 7, so is counted under a(7).
The a(1) = 0 through a(5) = 10 sets:
. . {1,2,3} {1,2,3} {1,2,3}
{1,3,4} {1,3,4}
{1,2,3,4} {1,4,5}
{2,3,5}
{1,2,3,4}
{1,2,3,5}
{1,2,4,5}
{1,3,4,5}
{2,3,4,5}
{1,2,3,4,5}
(End)
MATHEMATICA
Table[Length[Select[Subsets[Range[n]], Intersection[#, Total/@Subsets[#, {2}]]!={}&]], {n, 0, 10}] (* Gus Wiseman, Aug 10 2023 *)
CROSSREFS
The complement for partitions is A236912:
non-binary A237667,
ranks A364461,
strict A364533.
The version for partitions is A237113:
non-binary A237668,
ranks A364462,
strict A364670.
First differences are A364756.
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Oct 19 2003
EXTENSIONS
Terms a(32) and beyond from Fausto A. C. Cariboni, Sep 28 2020
STATUS
approved