T(n,k) = number of n X k arrays containing k indistinguishable copies of 1..n with rows and columns in lexicographically strictly increasing order.

A180839

T(n,k) = number of n X k arrays containing k indistinguishable copies of 1..n with rows and columns in lexicographically strictly increasing order.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =1a(8) =9a(9) =1a(10) =1a(11) =1a(12) =77a(13) =72a(14) =1a(15) =1a(16) =0a(17) =472a(18) =5385a(19) =678a(20) =1a(21) =1a(22) =0a(23) =2164a(24) =300888a(25) =545426a(26) =7719a(27) =1a(28) =1a(29) =0

External references