T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock differing from each horizontal or vertical neighbor.

A205466

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock differing from each horizontal or vertical neighbor.

Terms

    a(0) =256a(1) =2120a(2) =2120a(3) =17920a(4) =34792a(5) =17920a(6) =151824a(7) =597288a(8) =597288a(9) =151824a(10) =1285076a(11) =10306944a(12) =22414008a(13) =10306944a(14) =1285076a(15) =10876432a(16) =177411808a(17) =843904488a(18) =843904488a(19) =177411808a(20) =10876432a(21) =92062852a(22) =3053150968a(23) =31625643196

External references