A209516 Number of (n+1) X 8 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to the number of counterclockwise edge increases.

3813753, 2505266673, 1701725703867, 1170258116647953, 808953988260058047, 560493388203596285283, 388756746462464273412765, 269773510833311326186049823, 187249435580728303988081172345

Offset: 1

Author

R. H. Hardin, Mar 09 2012

Keywords

• nonn

Comments

Column 7 of A209517.

Examples

			Some solutions for n=4:
..2..1..0..2..1..2..2..1....2..2..2..2..1..0..2..0....2..0..1..2..2..1..1..1
..1..0..1..0..2..0..2..1....1..2..2..1..1..0..2..2....1..2..0..1..2..2..1..1
..0..2..0..0..0..1..0..2....0..1..1..2..2..1..0..2....0..1..2..0..1..2..2..1
..1..0..2..0..0..1..1..0....1..0..0..1..1..0..2..1....2..0..1..2..0..1..1..0
..0..1..0..1..0..0..0..0....0..1..0..0..0..0..2..1....1..2..0..1..2..0..0..2
		

Links

• R. H. Hardin, Table of n, a(n) for n = 1..210