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

A266921

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, southwest or southeast 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) =8a(13) =23a(14) =9a(15) =1a(16) =0a(17) =22a(18) =376a(19) =398a(20) =44a(21) =1a(22) =0a(23) =54a(24) =7137a(25) =40298a(26) =23432a(27) =265a(28) =1a(29) =0

External references