|
%I #7 Dec 13 2015 21:26:44
%S 139744,18037344,2475217568,343128343904,47661729160320,
%T 6623662914493232,920635927293402816,127966527042768090112,
%U 17787331384989306094464,2472447761779734270938096,343671940370501023645895072
%N Number of (n+1) X 5 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 4 of A206752.
%H R. H. Hardin, <a href="/A206748/b206748.txt">Table of n, a(n) for n = 1..92</a>
%e Some solutions for n=4:
%e ..2..1..0..3..1....0..0..3..0..0....2..3..2..0..1....3..1..0..2..1
%e ..0..2..1..0..2....1..1..0..3..3....2..2..3..1..2....0..3..1..3..2
%e ..2..0..3..1..0....3..3..1..0..3....0..2..2..3..0....3..2..3..3..2
%e ..1..2..1..2..1....1..1..3..1..0....0..0..2..2..3....3..2..2..2..0
%e ..1..1..0..1..0....0..1..1..2..1....2..0..2..3..2....2..0..2..0..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 12 2012
| 