login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A358456 Number of recursively bi-anti-transitive ordered rooted trees with n nodes. 5
1, 1, 2, 3, 7, 17, 47, 117, 321, 895, 2556, 7331, 21435, 63116, 187530 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
We define an unlabeled ordered rooted tree to be recursively bi-anti-transitive if there are no two branches of the same node such that one is a branch of the other.
LINKS
EXAMPLE
The a(1) = 1 through a(6) = 17 trees:
o (o) (oo) (ooo) (oooo) (ooooo)
((o)) ((oo)) ((ooo)) ((oooo))
(((o))) (((o))o) (((o))oo)
(((oo))) (((oo))o)
((o)(o)) (((ooo)))
(o((o))) ((o)(oo))
((((o)))) ((oo)(o))
(o((o))o)
(o((oo)))
(oo((o)))
((((o)))o)
((((o))o))
((((oo))))
(((o)(o)))
((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_, ___}, ___}|{___, {___, x_, ___}, ___, x_, ___}]&]], {n, 10}]
CROSSREFS
The unordered version is A324765, ranked by A324766.
The directed version is A358455.
A000108 counts ordered rooted trees, unordered A000081.
A306844 counts anti-transitive rooted trees.
A358453 counts transitive ordered trees, unordered A290689.
Sequence in context: A113483 A173868 A274291 * A208987 A176074 A281368
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Nov 18 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)