T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with column sums equal.

Terms

a(0) =1a(1) =1a(2) =2a(3) =1a(4) =4a(5) =6a(6) =1a(7) =8a(8) =36a(9) =24a(10) =1a(11) =16a(12) =216a(13) =648a(14) =120a(15) =1a(16) =32a(17) =1296a(18) =19584a(19) =19800a(20) =720a(21) =1a(22) =64a(23) =7776a(24) =643680a(25) =4140000a(26) =972000a(27) =5040a(28) =1a(29) =128