|
%I
%S 986388,30417316,2674444796,364197868292,51975660472496,
%T 7481908870312588,1078848431799509828,155633082985105845972,
%U 22454117874107278681104,3239703783044424175654576,467432771562040406990065172
%N Number of (n+1) X 6 0..3 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and the same number of counterclockwise edge increases as its vertical neighbors.
%C Column 5 of A206188.
%H R. H. Hardin, <a href="/A206185/b206185.txt">Table of n, a(n) for n = 1..49</a>
%e Some solutions for n=4:
%e ..2..3..1..3..2..2....0..0..2..1..0..1....1..2..1..3..3..0....1..2..0..1..3..0
%e ..1..1..3..2..1..3....2..1..3..2..1..3....1..3..2..1..0..2....1..2..0..1..3..0
%e ..2..2..3..0..1..1....2..2..3..0..1..2....3..3..0..1..1..2....2..2..0..1..3..3
%e ..1..3..1..2..0..2....1..3..1..3..0..1....1..0..2..0..3..1....2..0..0..1..1..1
%e ..1..0..2..0..3..2....0..0..2..0..3..0....1..1..2..3..3..0....0..0..1..1..2..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 04 2012
| 