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

A267655

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

Terms

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

External references