A382216 Number of normal multisets of size n that can be partitioned into a set of sets with distinct sums.
1, 1, 1, 3, 5, 11, 23, 48, 101, 208, 434
Offset: 0
Examples
The multiset {1,2,2,3,3} can be partitioned into a set of sets with distinct sums in 4 ways: {{2,3},{1,2,3}} {{2},{3},{1,2,3}} {{2},{1,3},{2,3}} {{1},{2},{3},{2,3}} so is counted under a(5). The multisets counted by A382214 but not by A382216 are: {1,1,1,1,2,2,3,3,3} {1,1,2,2,2,2,3,3,3} The a(1) = 1 through a(5) = 11 multisets: {1} {1,2} {1,1,2} {1,1,2,2} {1,1,1,2,3} {1,2,2} {1,1,2,3} {1,1,2,2,3} {1,2,3} {1,2,2,3} {1,1,2,3,3} {1,2,3,3} {1,1,2,3,4} {1,2,3,4} {1,2,2,2,3} {1,2,2,3,3} {1,2,2,3,4} {1,2,3,3,3} {1,2,3,3,4} {1,2,3,4,4} {1,2,3,4,5}
Crossrefs
The complement is counted by A382202.
Programs
-
Mathematica
allnorm[n_]:=If[n<=0,{{}},Function[s,Array[Count[s,y_/;y<=#]+1&,n]]/@Subsets[Range[n-1]+1]]; sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}]; mps[mset_]:=Union[Sort[Sort/@(#/.x_Integer:>mset[[x]])]&/@sps[Range[Length[mset]]]]; Table[Length[Select[allnorm[n],Length[Select[mps[#],And@@UnsameQ@@@#&&UnsameQ@@Total/@#&]]>0&]],{n,0,5}]
Comments