T(n,k)=number of nXk arrays containing k indistinguishable copies of 1..n with lexicographical ordering of rows strictly increasing and columns strictly decreasing.

A180843

T(n,k)=number of nXk arrays containing k indistinguishable copies of 1..n with lexicographical ordering of rows strictly increasing and columns strictly decreasing.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =0a(5) =1a(6) =1a(7) =1a(8) =2a(9) =1a(10) =1a(11) =0a(12) =19a(13) =17a(14) =1a(15) =1a(16) =0a(17) =44a(18) =596a(19) =131a(20) =1a(21) =1a(22) =0a(23) =98a(24) =14284a(25) =37423a(26) =1220a(27) =1a(28) =1a(29) =0

External references