94852
domain: N
Appears in sequences
- Triangle read by rows: T(n,1) = 1, T(n,k) = T(n-1,k)+(n-1)*T(n-1,k-1) for 1<=k<=n+1.at n=50A096747
- Triangle read by rows: T(n,1)=1, T(n,k) = T(n-1,k) + (n-1)T(n-1, k-1) for 1 <= k <= n.at n=41A109822
- Sum of the bottom levels of all columns in all deco polyominoes of height n. A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=8A122105
- T(n,k) = count of degree k monomials in the power sum symmetric polynomials p(mu,k) summed over all partitions mu of n.at n=31A209664
- Number of partitions of n into 4 sorts of parts.at n=8A246936
- Expansion of Product_{k>=1} 1/((1-x^(3*k-1))*(1-x^(3*k-2)))^k.at n=36A262883
- Triangle read by rows. Coefficients of the polynomials H(n, x) = Sum_{k=0..n-1} Sum_{i=0..k} abs(Stirling1(n, n - i)) * x^(n - k) in ascending order of powers.at n=49A358694