T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two.

A206197

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two.

Terms

    a(0) =124a(1) =1012a(2) =1012a(3) =8304a(4) =18172a(5) =8304a(6) =68180a(7) =329216a(8) =329216a(9) =68180a(10) =559788a(11) =5972392a(12) =13173864a(13) =5972392a(14) =559788a(15) =4596072a(16) =108363344a(17) =527945420a(18) =527945420a(19) =108363344a(20) =4596072a(21) =37735460a(22) =1966171084a(23) =21162670972a(24) =46704516192a(25) =21162670972

External references