T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.

A205736

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.

Terms

    a(0) =81a(1) =369a(2) =360a(3) =1764a(4) =978a(5) =1683a(6) =8655a(7) =3888a(8) =3318a(9) =7572a(10) =43155a(11) =17532a(12) =14715a(13) =9198a(14) =35577a(15) =218034a(16) =80916a(17) =80088a(18) =39450a(19) =34674a(20) =160218a(21) =1112664a(22) =376314a(23) =450339a(24) =223560a(25) =191766a(26) =97380a(27) =750426a(28) =5722236a(29) =1756446

External references