OFFSET
0,3
COMMENTS
If a partition is regarded as an arrow from the number of parts to the number of distinct parts, this sequence counts composable containments of partitions.
EXAMPLE
The a(0) = 1 through a(5) = 10 pairs:
()() (1)(1) (2)(2) (3)(3) (4)(4) (5)(5)
(11)(1) (21)(21) (31)(31) (41)(41)
(111)(1) (22)(2) (32)(32)
(211)(11) (311)(11)
(211)(21) (311)(31)
(1111)(1) (221)(21)
(221)(22)
(2111)(11)
(2111)(21)
(11111)(1)
MATHEMATICA
Table[Sum[Length[Union[Subsets[y, {Length[Union[y]]}]]], {y, IntegerPartitions[n]}], {n, 0, 15}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jul 02 2022
STATUS
approved