OFFSET
0,24
COMMENTS
We say that such partitions are of inseparable type. This is different from inseparable partitions (see A386584). A multiset is separable iff it has a permutation without any adjacent equal parts.
EXAMPLE
The partition y = (7,2,1) is the multiplicities of the multiset {1,1,1,1,1,1,1,2,2,3}, which is inseparable, so y is counted under T(10,3).
Row n = 10 counts the following partitions (A = 10):
. A 91 811 7111 61111 . . . . .
82 721 6211
73 631
64 622
Triangle begins:
0
0 0
0 1 0
0 1 0 0
0 1 1 0 0
0 1 1 0 0 0
0 1 2 1 0 0 0
0 1 2 1 0 0 0 0
0 1 3 2 1 0 0 0 0
0 1 3 2 1 0 0 0 0 0
0 1 4 4 2 1 0 0 0 0 0
MATHEMATICA
insepQ[y_]:=Select[Permutations[y], Length[Split[#]]==Length[y]&]=={};
ptm[y_]:=Join@@Table[ConstantArray[k, y[[k]]], {k, Length[y]}];
Table[Length[Select[IntegerPartitions[n, {k}], insepQ[ptm[#]]&]], {n, 0, 5}, {k, 0, n}]
CROSSREFS
KEYWORD
AUTHOR
Gus Wiseman, Aug 05 2025
STATUS
approved
