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 equal to the number of counterclockwise edge increases.
A208492
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 equal to the number of counterclockwise edge increases.
Terms
- a(0) =152a(1) =1448a(2) =1448a(3) =13800a(4) =33416a(5) =13800a(6) =131528a(7) =773288a(8) =773288a(9) =131528a(10) =1253608a(11) =17903016a(12) =43689232a(13) =17903016a(14) =1253608a(15) =11948296a(16) =414522184a(17) =2473041560a(18) =2473041560a(19) =414522184a(20) =11948296a(21) =113880744a(22) =9597910280a(23) =140051200968
External references
- oeis: A208492