T(n,k) = number of (n+1) X (k+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having an equal number of clockwise and counterclockwise edge increases.

A206414

T(n,k) = number of (n+1) X (k+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having an equal number of clockwise and counterclockwise edge increases.

Terms

    a(0) =81a(1) =423a(2) =423a(3) =2457a(4) =5199a(5) =2457a(6) =15087a(7) =69585a(8) =69585a(9) =15087a(10) =94761a(11) =953865a(12) =2073999a(13) =953865a(14) =94761a(15) =600519a(16) =13148043a(17) =62351943a(18) =62351943a(19) =13148043a(20) =600519a(21) =3818649a(22) =181467207a(23) =1876995285a(24) =4099250889a(25) =1876995285a(26) =181467207a(27) =3818649a(28) =24314127

External references