|
|
A358460
|
|
Number of locally disjoint ordered rooted trees with n nodes.
|
|
1
|
|
|
1, 1, 2, 5, 13, 36, 103, 301, 902, 2767, 8637, 27324, 87409, 282319, 919352
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Locally disjoint means no branch of any vertex overlaps a different (unequal) branch of the same vertex.
|
|
LINKS
|
|
|
EXAMPLE
|
The a(1) = 1 through a(5) = 13 trees:
o (o) (oo) (ooo) (oooo)
((o)) ((o)o) ((o)oo)
((oo)) ((oo)o)
(o(o)) ((ooo))
(((o))) (o(o)o)
(o(oo))
(oo(o))
(((o))o)
(((o)o))
(((oo)))
((o(o)))
(o((o)))
((((o))))
|
|
MATHEMATICA
|
aot[n_]:=If[n==1, {{}}, Join @@ Table[Tuples[aot/@c], {c, Join@@Permutations/@IntegerPartitions[n-1]}]];
Table[Length[Select[aot[n], FreeQ[#, {___, {___, x_, ___}, ___, {___, x_, ___}, ___}]&]], {n, 10}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|