|
%I #7 Dec 13 2015 21:31:04
%S 1289472,415429504,140074119984,47661729160320,16261882009570952,
%T 5553852508380267184,1897470427514439403464,648358115933748841946976,
%U 221552861031935138886277472,75709141973478718002175226936
%N Number of (n+1) X 6 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an equal number of clockwise and counterclockwise edge increases.
%C Column 5 of A206752.
%H R. H. Hardin, <a href="/A206749/b206749.txt">Table of n, a(n) for n = 1..23</a>
%e Some solutions for n=4:
%e ..1..1..2..2..3..2....0..0..2..1..1..0....0..2..3..0..1..0....0..1..0..1..1..0
%e ..1..0..1..1..2..3....2..2..2..2..1..0....1..3..2..3..0..1....3..0..1..2..1..1
%e ..3..2..3..1..1..2....3..2..0..2..1..0....0..2..1..2..3..0....1..2..3..1..3..3
%e ..1..0..2..3..3..0....0..3..2..0..3..1....1..0..2..2..3..0....1..2..2..3..2..2
%e ..3..1..3..1..3..3....0..3..2..2..0..2....1..1..3..2..3..0....2..0..0..1..0..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 12 2012
| 