%I #7 Oct 06 2015 21:45:14

%S 113880744,222232271912,449271828443912,920635760474340792,

%T 1897470416545860341536,3920972889443714995894776,

%U 8112174131718066295245481744,16792956299828228584347524939848

%N Number of (n+1) X 8 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 7 of A208492.

%H R. H. Hardin, <a href="/A208491/b208491.txt">Table of n, a(n) for n = 1..161</a>

%e Some solutions for n=4:

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 27 2012