T(n,k)=Number of (n+1)X(k+1) 0..3 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.

A205659

T(n,k)=Number of (n+1)X(k+1) 0..3 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) =256a(1) =1976a(2) =2120a(3) =15616a(4) =12296a(5) =17920a(6) =124048a(7) =95008a(8) =75108a(9) =151824a(10) =986388a(11) =839872a(12) =511632a(13) =489984a(14) =1285076a(15) =7854572a(16) =7919128a(17) =5016144a(18) =3227968a(19) =3323532a(20) =10876432a(21) =62623348a(22) =76028256a(23) =57716364a(24) =41013960a(25) =21711080a(26) =23019504a(27) =92062852

External references