Triangle read by rows, T(n,k) = Sum_{j=0..n-k+1} P(n,j)*T(n-j,k-1) if k>0 else 0^n where P(n,j) is the number of j-partitions of n; for n>=0 and 0<=k<=n.

A257566

Triangle read by rows, T(n,k) = Sum_{j=0..n-k+1} P(n,j)*T(n-j,k-1) if k>0 else 0^n where P(n,j) is the number of j-partitions of n; for n>=0 and 0<=k<=n.