%I
%S 62623348,732727336,9029185188,186979308144,4682468347176,
%T 106351019923768,2904705131186012,69836058310563888,
%U 1989650257922684392,48627125950280766136,1406446756952780801628,34607286834571007711144
%N Number of (n+1)X8 0..3 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.
%C Column 7 of A205659.
%H R. H. Hardin, <a href="/A205658/b205658.txt">Table of n, a(n) for n = 1..16</a>
%e Some solutions for n=4:
%e ..2..0..2..1..1..0..1..1....1..2..0..0..1..3..3..2....3..3..0..1..0..3..1..0
%e ..0..0..0..0..0..0..0..0....2..0..2..1..0..2..1..0....1..3..0..1..0..3..1..3
%e ..0..0..0..0..0..0..0..0....0..0..0..0..0..0..0..0....0..1..3..0..2..1..0..3
%e ..3..3..3..3..3..3..3..3....0..0..0..0..0..0..0..0....0..1..3..0..2..1..0..1
%e ..3..3..3..3..3..3..3..3....2..3..3..3..0..1..1..0....1..2..0..1..0..3..2..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 30 2012
