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

A206094

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

Terms

    a(0) =81a(1) =270a(2) =270a(3) =972a(4) =780a(5) =972a(6) =3564a(7) =2016a(8) =2016a(9) =3564a(10) =13608a(11) =5952a(12) =4560a(13) =5952a(14) =13608a(15) =52812a(16) =17976a(17) =13344a(18) =13344a(19) =17976a(20) =52812a(21) =205416a(22) =54432a(23) =33792a(24) =48816a(25) =33792a(26) =54432a(27) =205416a(28) =803844a(29) =165936

External references