OFFSET
0,16
COMMENTS
A partition is Look-and-Say iff it is possible to choose a disjoint family of strict partitions, one of each of its multiplicities. These are ranked by A351294.
A partition is section-sum iff its conjugate is Look-and-Say, meaning it is possible to choose a disjoint family of strict partitions, one of each of its positive 0-appended differences. These are ranked by A381432.
A partition is Wilf iff its multiplicities are all different (ranked by A130091).
EXAMPLE
The a(n) partitions for n = 12, 15, 20, 24, 28:
(6,3,3) (6,6,3) (8,8,4) (12,6,6) (14,7,7)
(6,3,3,3) (10,5,5) (6,6,6,3,3) (8,8,8,4)
(8,4,4,4) (8,4,4,4,4) (8,8,4,4,4)
(6,6,3,3,3,3) (8,4,4,4,4,4)
(6,3,3,3,3,3,3) (10,6,6,2,2,2)
(11,6,6,1,1,1,1,1)
MATHEMATICA
disjointFamilies[y_]:=Select[Tuples[IntegerPartitions /@ Length/@Split[y]], UnsameQ@@Join@@#&];
conj[y_]:=If[Length[y]==0, y, Table[Length[Select[y, #>=k&]], {k, 1, Max[y]}]];
Table[Length[Select[IntegerPartitions[n], disjointFamilies[#]!={}&&disjointFamilies[conj[#]]!={} && !UnsameQ@@Length/@Split[#]&]], {n, 0, 30}]
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, May 18 2025
STATUS
approved
