Combinatorics Problem 1
We consider the species T of such trees. An object in T is either a single node ∙ or a single node followed by two or three trees. Hence the combinatorial construction is
T={∙} ∪˙ ({∙}×T×T) ∪˙ ({∙}×T×T×T),
which translates into the equation T(z)=z+zT2(z)+zT3(z) for the generating function T(z)∈C[[z]], which is equivalent to z=1+T2(z)+T3(z)T(z). Thus, the compositional inverse of T(z) is 1+z2+z3z. By Lagrange's inversion formula one gets for the n-th coefficient of T(z):
n1[[z−1]](1+z2+z3z)−n=n1[[z−1]]zn1(1+z2+z3)n=n1[[z−1]]zn1k=0∑n(kn)(z2+z3)k=n1[[z−1]]k=0∑n(kn)z2k−n(1+z)k
=n1[[z−1]]k=0∑nl=0∑k(kn)(lk)z2k−n+l=n1k=0∑n(kn)(n−2k−1k)=n1k=0∑n(kn)(3k−n+1k)
The result is the formula we wanted to find.