OFFSET
0,3
LINKS
Hiroaki Yamanouchi, Table of n, a(n) for n = 0..500
Gus Wiseman, The a(8) = 39 constant-sum split partitions.
Gus Wiseman, The a(10) = 64 constant-sum split partitions.
Gus Wiseman, The a(12) = 146 constant-sum split partitions.
EXAMPLE
The a(4) = 9 constant-sum split partitions:
(4),
(31),
(22), (2)(2),
(211), (2)(11),
(1111), (11)(11), (1)(1)(1)(1).
The a(6) = 21 constant-sum split partitions:
(6),
(51),
(42),
(411),
(33), (3)(3),
(321), (3)(21),
(3111), (3)(111),
(222), (2)(2)(2),
(2211), (2)(2)(11),
(21111), (21)(111), (2)(11)(11),
(111111), (111)(111), (11)(11)(11), (1)(1)(1)(1)(1)(1).
MATHEMATICA
comps[q_]:=Table[Table[Take[q, {Total[Take[c, i-1]]+1, Total[Take[c, i]]}], {i, Length[c]}], {c, Join@@Permutations/@IntegerPartitions[Length[q]]}];
Table[Sum[Length[Select[comps[y], SameQ@@Total/@#&]], {y, IntegerPartitions[n]}], {n, 10}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, Sep 29 2018
EXTENSIONS
a(16)-a(46) from Hiroaki Yamanouchi, Oct 02 2018
STATUS
approved