108472
domain: N
Appears in sequences
- Expansion of (theta_3(z)*theta_3(11z) + theta_2(z)*theta_2(11z))^4.at n=36A028612
- Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 3 (0<=k<=floor(n/3)). Also number of ordered trees with n edges that have k vertices of outdegree 3.at n=43A114506
- G.f.: A(x) = INV(x*(1-x) - x^2*INV(x*(1-x)^2 - x^2*INV(x*(1-x)^3 - x^2*INV(x*(1-x)^4 - x^2*INV(x*(1-x)^5 - ...))))), where INV(F(x)) = series reversion of F(x).at n=8A196708
- Square array A(n,k), n>=0, k>=0, read by antidiagonals, where A(0,k) = 1 and A(n,k) = Sum_{j=0..n-1} k^j * binomial(n-1,j) * A(j,k) for n > 0.at n=41A306245
- G.f. A(x) satisfies A(x) = 1 + x * A(3 * x / (1 - x)) / (1 - x).at n=5A355081