OFFSET
1,6
COMMENTS
Node-height is the number of nodes in the longest path from root to leaf.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..200
EXAMPLE
The a(1) = 0 through a(7) = 10 trees:
. . . (ooo) (oooo) (ooooo) (oooooo)
((oooo)) ((ooooo))
(o(ooo)) (o(oooo))
(oo(oo)) (oo(ooo))
(ooo(o)) (ooo(oo))
(oooo(o))
((o)(ooo))
((oo)(oo))
(o(o)(oo))
(oo(o)(o))
MATHEMATICA
art[n_]:=If[n==1, {{}}, Join@@Table[Select[Tuples[art/@c], OrderedQ], {c, Join@@Permutations/@IntegerPartitions[n-1]}]];
Table[Length[Select[art[n], Depth[#]-1<Count[#, {}, {-2}]&]], {n, 1, 10}]
PROG
(PARI) \\ Needs R(n, f) defined in A358589.
seq(n) = {Vec(R(n, (h, p)->sum(j=h+1, n-1, polcoef(p, j, y))), -n)} \\ Andrew Howroyd, Jan 01 2023
CROSSREFS
These trees are ranked by A358727.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Nov 29 2022
EXTENSIONS
Terms a(19) and beyond from Andrew Howroyd, Jan 01 2023
STATUS
approved