293608

Appears in sequences

• Expansion of e.g.f. exp(x*exp(x)).at n=9A000248
• Triangle T, read by rows, equal to Pascal's triangle to the matrix power of Pascal's triangle, so that T = C^C, where C(n,k) = binomial(n,k) and T(n,k) = A000248(n-k)*C(n,k).at n=45A116071
• Triangle T(n,k)=number of forests of labeled rooted trees of height at most 1, with n labels and k nodes, where any root may contain >= 1 labels, n >= 0, 0<=k<=n.at n=54A143397
• Triangle T(n,k) = number of forests of labeled rooted trees of height at most 1, with n labels, where each root contains k labels, n>=0, 0<=k<=n.at n=46A143398
• Square array A(n,k), n>=0, k>=0, read by antidiagonals, where sequence a_k of column k is the exponential transform of C(n,k).at n=64A145460
• Expansion of (1+13*x+32*x^2+13*x^3+x^4)/(1-x)^5.at n=18A160765
• Triangle T(n,k) read by rows: number of height-2-restricted finite functions.at n=45A187105
• Triangle read by rows: T(n,k) = number of forests of labeled rooted trees with n nodes and height at most k (n>=1, 0<=k<=n-1).at n=37A210725
• Triangle read by rows: T(n,k) is the number of partial idempotent mappings (of an n-chain) with breadth exactly k.at n=54A259760
• Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the exponential transform of the k-th powers.at n=64A279636
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(0,k) = 1 and T(n,k) = k! * Sum_{i=0..n-1} binomial(n-1,i) * binomial(i+1,k) * T(n-1-i,k) for n > 0.at n=64A292978