OFFSET
0,7
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(3) = 1 through a(10) = 14 partitions:
(21) . . (42) (421) (431) (432) (532)
(321) (3211) (521) (531) (541)
(2211) (3221) (621) (721)
(4211) (3321) (4321)
(32111) (4221) (5221)
(4311) (5311)
(5211) (6211)
(32211) (32221)
(42111) (33211)
(321111) (42211)
(43111)
(52111)
(421111)
(3211111)
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, 15}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, May 18 2025
STATUS
approved
