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

A206206

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

Terms

    a(0) =256a(1) =480a(2) =480a(3) =1768a(4) =1060a(5) =1768a(6) =7388a(7) =3008a(8) =3008a(9) =7388a(10) =29724a(11) =9464a(12) =5136a(13) =9464a(14) =29724a(15) =117084a(16) =22576a(17) =11832a(18) =11832a(19) =22576a(20) =117084a(21) =468968a(22) =67968a(23) =27400a(24) =32920a(25) =27400a(26) =67968a(27) =468968a(28) =1878808a(29) =192808

External references