A104731 Triangle T(n,k) = sum_{j=k..n} (j+1)*binomial(k,j-k), read by rows, 0<=k<=n.
1, 1, 2, 1, 5, 3, 1, 5, 11, 4, 1, 5, 16, 19, 5, 1, 5, 16, 37, 29, 6, 1, 5, 16, 44, 71, 41, 7, 1, 5, 16, 44, 103, 121, 55, 8, 1, 5, 16, 44, 112, 211, 190, 71, 9, 1, 5, 16, 44, 112, 261, 390, 281, 89, 10, 1, 5, 16, 44, 112, 272, 555, 666, 397, 109, 11
Offset: 0
Examples
The first few rows of the triangle are: 1; 1, 2; 1, 5, 3; 1, 5, 11, 4 1, 5, 16, 19, 5; 1, 5, 16, 37, 29, 6; ...
Formula
Product of the triangles A(n,k) = k+1 and B = binomial(k,n-k) = [1; 0, 1; 0, 1, 1; 0, 0, 2, 1; 0, 0, 1, 3, 1;...], the triangular view of A026729.