T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases.

A206063

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases.

Terms

    a(0) =256a(1) =2184a(2) =2184a(3) =19832a(4) =21140a(5) =19832a(6) =170688a(7) =167960a(8) =167960a(9) =170688a(10) =1499080a(11) =1390488a(12) =1278672a(13) =1390488a(14) =1499080a(15) =13136860a(16) =11638960a(17) =11155584a(18) =11155584a(19) =11638960a(20) =13136860a(21) =114770680a(22) =96831504a(23) =101369476a(24) =111242648a(25) =101369476

External references