T(n,k) = Number of n X k arrays containing k copies of 0..n-1 with no element 1 greater than its north or southwest neighbor modulo n and the upper left element equal to 0.

A266861

T(n,k) = Number of n X k arrays containing k copies of 0..n-1 with no element 1 greater than its north or southwest neighbor modulo n and the upper left element equal to 0.

Terms

    a(0) =1a(1) =1a(2) =0a(3) =1a(4) =0a(5) =1a(6) =1a(7) =0a(8) =4a(9) =2a(10) =1a(11) =0a(12) =17a(13) =39a(14) =9a(15) =1a(16) =0a(17) =66a(18) =999a(19) =1281a(20) =44a(21) =1a(22) =0a(23) =324a(24) =31501a(25) =328701a(26) =67240a(27) =265a(28) =1a(29) =0

External references