272250
domain: N
Appears in sequences
- Number of forests of labeled rooted trees with n nodes, containing exactly 2 trees of height one, all others having height zero.at n=10A133386
- Triangle T(n,k)=number of forests of labeled rooted trees with n nodes, containing exactly k trees of height one, all others having height zero (n>=0, 0<=k<=floor(n/2)).at n=32A133399
- Series reversion of (1 - t*x)*log(1 + x) with respect to x.at n=38A198204
- Expansion of e.g.f. (1 - x)^(-x^4/24).at n=11A355507
- Expansion of g.f. A(x,y) satisfying y/x = Sum_{n=-oo..+oo} x^(n*(3*n+1)/2) * (A(x,y)^(3*n) - 1/A(x,y)^(3*n+1)), as a triangle read by rows.at n=32A361050