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

A206021

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

Terms

    a(0) =104a(1) =680a(2) =680a(3) =4440a(4) =7688a(5) =4440a(6) =29000a(7) =87448a(8) =87448a(9) =29000a(10) =189400a(11) =996840a(12) =1763560a(13) =996840a(14) =189400a(15) =1237000a(16) =11364568a(17) =35846696a(18) =35846696a(19) =11364568a(20) =1237000a(21) =8079000a(22) =129573608a(23) =729589784a(24) =1312173688a(25) =729589784a(26) =129573608

External references