T(n,k)=Number of nXk 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other.

A203638

T(n,k)=Number of nXk 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other.

Terms

    a(0) =2a(1) =4a(2) =4a(3) =4a(4) =4a(5) =4a(6) =2a(7) =6a(8) =6a(9) =2a(10) =8a(11) =6a(12) =8a(13) =6a(14) =8a(15) =12a(16) =26a(17) =52a(18) =52a(19) =26a(20) =12a(21) =6a(22) =90a(23) =236a(24) =154a(25) =236a(26) =90a(27) =6a(28) =32a(29) =222

External references