[go: up one dir, main page]

login
A316500
Number of unlabeled rooted identity trees with n nodes in which the branches of any node with more than one branch have empty intersection.
6
1, 1, 1, 2, 3, 6, 11, 22, 46, 96, 205, 442, 976, 2146, 4789, 10719, 24202, 54841, 124967, 285724, 656011, 1510929, 3491151, 8088692, 18790084
OFFSET
1,4
EXAMPLE
The a(7) = 11 rooted identity trees:
((((((o))))))
((((o(o)))))
(((o((o)))))
((o(((o)))))
((o(o(o))))
(((o)((o))))
(o((((o)))))
(o((o(o))))
(o(o((o))))
((o)(((o))))
(o(o)((o)))
MATHEMATICA
strut[n_]:=strut[n]=If[n===1, {{}}, Select[Join@@Function[c, Union[Sort/@Tuples[strut/@c]]]/@IntegerPartitions[n-1], UnsameQ@@#&&Or[Length[#]==1, Intersection@@#=={}]&]];
Table[Length[strut[n]], {n, 20}]
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Jul 05 2018
STATUS
approved