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

A206137

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

Terms

    a(0) =256a(1) =564a(2) =564a(3) =3092a(4) =6668a(5) =3092a(6) =19660a(7) =91924a(8) =91924a(9) =19660a(10) =125236a(11) =1269044a(12) =2761756a(13) =1269044a(14) =125236a(15) =797996a(16) =17521788a(17) =83120732a(18) =83120732a(19) =17521788a(20) =797996a(21) =5085012a(22) =241927532a(23) =2502596196a(24) =5465582068a(25) =2502596196a(26) =241927532

External references