T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.

A267328

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =2a(6) =1a(7) =10a(8) =0a(9) =6a(10) =1a(11) =35a(12) =1a(13) =0a(14) =24a(15) =1a(16) =126a(17) =15a(18) =0a(19) =0a(20) =120a(21) =1a(22) =462a(23) =65a(24) =1a(25) =0a(26) =0a(27) =720a(28) =1a(29) =1716

External references