|
|
A324770
|
|
Number of fully anti-transitive rooted identity trees with n nodes.
|
|
7
|
|
|
1, 1, 1, 1, 2, 3, 6, 13, 27, 58, 128, 286, 640, 1452, 3308, 7594, 17512, 40591, 94449, 220672
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
An unlabeled rooted tree is fully anti-transitive if no proper terminal subtree of any branch of the root is a branch of the root. It is an identity tree if there are no repeated branches directly under the same root.
|
|
LINKS
|
|
|
EXAMPLE
|
The a(1) = 1 through a(7) = 6 fully anti-transitive 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))))))
|
|
MATHEMATICA
|
idall[n_]:=If[n==1, {{}}, Select[Union[Sort/@Join@@(Tuples[idall/@#]&/@IntegerPartitions[n-1])], UnsameQ@@#&]];
Table[Length[Select[idall[n], Intersection[Union@@Rest[FixedPointList[Union@@#&, #]], #]=={}&]], {n, 10}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|