OFFSET
0,3
COMMENTS
An integer 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.
An integer 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.
EXAMPLE
The a(1) = 1 through a(8) = 9 partitions:
(1) (2) (3) (4) (5) (6) (7) (8)
(11) (111) (22) (311) (33) (322) (44)
(1111) (11111) (222) (331) (332)
(411) (511) (611)
(3111) (4111) (2222)
(111111) (31111) (5111)
(1111111) (41111)
(311111)
(11111111)
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[#]]!={}&]], {n, 0, 30}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, May 17 2025
STATUS
approved
