OFFSET
1,2
COMMENTS
A rooted Greg hypertree is a hypertree with black and white vertices such that white vertices are labeled, black vertices are unlabeled, and each black vertex has at least two children.
The weight of a forest of rooted Greg hypertrees is the number of hypertrees minus 1 plus the weight of each hyperedge which is the number of vertices it connects minus 2. See A364709 for the analog sequence for hypertrees. A forest of rooted Greg hypertrees of weight 0 is exactly a Greg tree.
LINKS
Paul Laubie, Hypertrees and embedding of the FMan operad, arXiv:2401.17439 [math.QA], 2024.
FORMULA
E.g.f: series reversion in t of (log(1+v*t)/v - exp(t) + t + 1)*exp(-t), where the formal variable v encodes the weight.
T(n,0) = A005264(n).
T(n,n-1) = 1.
EXAMPLE
Triangle T(n,k) begins:
n\k 0 1 2 3 4 ...
1 1;
2 3, 1;
3 22, 15, 1;
4 262, 271, 53, 1;
5 4336, 6020, 2085, 165, 1;
...
PROG
(PARI) T(n)={my(x='x+O('x^(n+1))); [Vecrev(p) | p <- Vec(serlaplace(serreverse( (log(1+y*x)/y - exp(x) + x + 1)*exp(-x) )))]}
{ my(A=T(8)); for(i=1, #A, print(A[i])) } \\ Andrew Howroyd, Mar 06 2024
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Paul Laubie, Mar 06 2024
STATUS
approved