%I #7 Oct 06 2015 21:44:28

%S 1253608,414522184,140051200968,47661128330328,16261866249456960,

%T 5553852092522802280,1897470416545860341536,648358115644067172499256,

%U 221552861024287017431767352,75709141973276719446226452336

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

%C Column 5 of A208492.

%H R. H. Hardin, <a href="/A208489/b208489.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=4:

%e ..0..0..1..2..0..3....2..0..1..3..2..0....0..2..3..2..3..3....2..1..1..2..1..1

%e ..3..0..1..1..2..0....0..0..0..1..0..1....2..3..0..3..1..3....0..2..1..1..0..0

%e ..1..2..0..0..1..2....3..3..3..0..3..0....3..2..3..0..2..1....2..1..1..0..2..2

%e ..3..0..1..1..0..1....3..0..3..0..3..3....0..3..2..3..0..2....0..2..1..0..2..1

%e ..3..3..0..0..1..0....3..0..0..0..3..2....1..0..3..3..3..0....0..0..2..1..3..2

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 27 2012