OFFSET
0,7
COMMENTS
This is the number of strict integer partitions of n containing at least one sum of distinct non-parts.
Conjecture: Also the number of strict integer partitions of n such that it is possible in more than one way to choose a disjoint family of strict integer partitions, one of each part.
EXAMPLE
For y = (5,4,2) we have 4 = 3+1 so y is counted under a(11).
On the other hand, no part of z = (6,4,1) is a subset-sum of the non-parts {2,3,5}, so z is not counted under a(11).
The a(3) = 1 through a(11) = 10 strict partitions:
(3) (4) (5) (6) (7) (8) (9) (10) (11)
(4,2) (4,3) (5,3) (5,4) (6,4) (6,5)
(5,1) (5,2) (6,2) (6,3) (7,3) (7,4)
(6,1) (7,1) (7,2) (8,2) (8,3)
(8,1) (9,1) (9,2)
(5,3,2) (10,1)
(5,4,1) (5,4,2)
(6,3,1) (6,3,2)
(7,2,1) (7,3,1)
(8,2,1)
MATHEMATICA
nonsets[y_]:=If[Length[y]==0, {}, Rest[Subsets[Complement[Range[Max@@y], y]]]];
Table[Length[Select[IntegerPartitions[n], UnsameQ@@#&&Intersection[#, Total/@nonsets[#]]!={}&]], {n, 0, 30}]
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, May 28 2025
STATUS
approved
