OFFSET
1,3
COMMENTS
A rooted tree is series-reduced if every non-leaf node has at least two branches. It is locally nonintersecting if the intersection of all branches directly under any given root is empty. It is an identity tree if no branch appears multiple times under the same root.
EXAMPLE
The a(6) = 13 trees:
(1(1(1(12))))
(1(1(13)))
(1(2(12)))
(2(1(12)))
(12(12))
(1(14))
(1(23))
(2(13))
(3(12))
(123)
(15)
(24)
6
Examples of series-reduced rooted identity trees that are not locally nonintersecting are ((12)(13)) and ((12)(1(12))).
MATHEMATICA
nonintQ[u_]:=Intersection@@u=={};
nms[n_]:=nms[n]=Prepend[Join@@Table[Select[Union[Sort/@Tuples[nms/@ptn]], And[UnsameQ@@#, nonintQ[#]]&], {ptn, Rest[IntegerPartitions[n]]}], {n}];
Table[Length[nms[n]], {n, 15}]
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Jul 12 2018
EXTENSIONS
a(21)-a(22) from Robert Price, Sep 14 2018
STATUS
approved