%I #7 Dec 13 2015 21:22:44
%S 24336,317736,5747676,84549024,1533200232,22293930744,401233408020,
%T 5846128911096,105220089057252,1533334835456760,27601628613864552,
%U 402223201377376200,7240509893370945276,105511280014998057264
%N Number of (n+1) X 6 0..2 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases.
%C Column 5 of A206685.
%H R. H. Hardin, <a href="/A206682/b206682.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=4:
%e ..1..2..0..1..2..1....2..2..1..2..2..2....2..0..2..1..0..1....2..1..2..1..1..1
%e ..2..2..1..0..0..2....1..2..0..1..0..0....2..0..1..1..2..0....1..0..2..2..0..0
%e ..0..1..1..2..0..1....0..2..2..1..1..2....2..1..2..0..1..0....1..2..0..1..2..1
%e ..2..0..2..2..1..2....0..0..1..2..0..1....1..1..0..2..2..1....0..1..1..0..2..2
%e ..1..0..0..1..0..2....2..1..1..0..0..2....0..2..1..1..2..0....2..1..1..2..0..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 11 2012