OFFSET
1,4
COMMENTS
Edge-height (A109082) is the number of edges 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) = 7 trees:
. (o) . ((oo)) ((o)(o)) (((ooo))) (((o))(oo))
(o(o)) ((o(oo))) (((o)(oo)))
((oo(o))) ((o)((oo)))
(o((oo))) ((o)(o(o)))
(o(o(o))) ((o(o)(o)))
(oo((o))) (o((o)(o)))
(o(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], Count[#, {}, {-2}]==Depth[#]-2&]], {n, 1, 10}]
PROG
(PARI) \\ Needs R(n, f) defined in A358589.
seq(n) = {Vec(R(n, (h, p)->polcoef(p, h-1, y)), -n)} \\ Andrew Howroyd, Jan 01 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, Nov 29 2022
EXTENSIONS
Terms a(19) and beyond from Andrew Howroyd, Jan 01 2023
STATUS
approved