OFFSET
1,3
COMMENTS
A rooted tree is anti-transitive if the subbranches are disjoint from the branches, i.e., no branch of a branch is a branch.
LINKS
Gus Wiseman, The a(7) = 36 anti-transitive rooted trees.
Gus Wiseman, The a(10) = 532 anti-transitive rooted trees.
EXAMPLE
The a(1) = 1 through a(6) = 14 anti-transitive rooted trees:
o (o) (oo) (ooo) (oooo) (ooooo)
((o)) ((oo)) ((ooo)) ((oooo))
(((o))) (((oo))) (((ooo)))
((o)(o)) ((o)(oo))
((o(o))) ((o(oo)))
(o((o))) ((oo(o)))
((((o)))) (o((oo)))
(oo((o)))
((((oo))))
(((o)(o)))
(((o(o))))
((o((o))))
(o(((o))))
(((((o)))))
MATHEMATICA
rtall[n_]:=Union[Sort/@Join@@(Tuples[rtall/@#]&/@IntegerPartitions[n-1])];
Table[Length[Select[rtall[n], Intersection[Union@@#, #]=={}&]], {n, 10}]
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Mar 13 2019
EXTENSIONS
a(16)-a(20) from Jinyuan Wang, Jun 20 2020
STATUS
approved