Triangular array T(n,0)= 1, T(n,k) = sum_{j=1..min(n,k)} (n-j+1)*T(j,k-j) if k>0.

A054250

Triangular array T(n,0)= 1, T(n,k) = sum_{j=1..min(n,k)} (n-j+1)*T(j,k-j) if k>0.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =3a(6) =1a(7) =3a(8) =5a(9) =8a(10) =1a(11) =4a(12) =7a(13) =12a(14) =20a(15) =1a(16) =5a(17) =9a(18) =16a(19) =28a(20) =45a(21) =1a(22) =6a(23) =11a(24) =20a(25) =36a(26) =60a(27) =95a(28) =1a(29) =7

External references