A209517 T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to the number of counterclockwise edge increases.
57, 363, 363, 2313, 4995, 2313, 14739, 68937, 68937, 14739, 93921, 951777, 2071311, 951777, 93921, 598491, 13141335, 62340543, 62340543, 13141335, 598491, 3813753, 181445643, 1876947141, 4099186545, 1876947141, 181445643, 3813753, 24302307
Offset: 1
Examples
Some solutions for n=4, k=3: ..0..0..2..1....0..1..0..2....1..2..2..1....2..2..1..2....2..1..0..2 ..2..0..2..2....2..0..0..2....2..0..2..1....2..2..1..1....1..1..1..0 ..0..2..2..0....2..0..1..0....2..2..1..0....0..2..2..1....1..1..2..1 ..2..2..0..1....2..2..0..1....1..2..1..1....0..2..0..2....1..1..1..1 ..2..1..2..0....1..2..2..0....1..2..1..2....2..2..0..0....2..2..1..2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..220
Comments