41377
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) = number of partitions of binomial(n,k) into parts greater than k and not greater than n, 0<=k<=n.at n=72A090824
- Number of subtrees of a complete binary tree.at n=26A157679
- Expansion of x * psi(x^3) * psi(x^12) / f(-x) in powers of x where psi(), f() are Ramanujan theta functions.at n=38A260600