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

A207799

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

Terms

    a(0) =256a(1) =2208a(2) =2208a(3) =20800a(4) =37408a(5) =20800a(6) =184416a(7) =643968a(8) =643968a(9) =184416a(10) =1714176a(11) =11074704a(12) =22773384a(13) =11074704a(14) =1714176a(15) =15376544a(16) =190505040a(17) =748331168a(18) =748331168a(19) =190505040a(20) =15376544a(21) =141647296a(22) =3276916896a(23) =26462419832

External references