OFFSET
0,3
COMMENTS
A standard heap-ordered tree with n+1 nodes is a finite rooted tree in which all the nodes except the root are labeled with the natural numbers between 1 and n, which satisfies the property that the labels of the children of a node are all larger than the label of the node.
Rooted trees counted by a(n) have n non-root vertices with two independent heap ordering labelings. The number of standard heap-ordered trees with n non-root vertices is A001147(n). - Andrey Zabolotskiy, Sep 16 2022
LINKS
T. D. Noe, Table of n, a(n) for n = 0..100
R. L. Grossman and R. G. Larson, Hopf Algebras of Heap Ordered Trees and Permutations, arXiv:0706.1327 [math.RA], 2007.
FORMULA
Doubly exponential generating function f(z) = Sum_{n>=0} a(n+1) z^n/n!^2 satisfies zf"+f'=1/(1-f). [Clarified by Andrey Zabolotskiy, Sep 16 2022]
a(n) = Sum_{k=0..n-1} binomial(n, k)^2*a(k)*a(n-k-1). - Vladeta Jovovic, Oct 22 2005
MATHEMATICA
t = {1}; Do[AppendTo[t, Sum[Binomial[n, k]^2 t[[k+1]] t[[n-k]], {k, 0, n-1}]], {n, 20}] (* T. D. Noe, Jun 25 2012 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Name edited by Andrey Zabolotskiy, Sep 16 2022
STATUS
approved