%I #7 Dec 13 2015 16:33:01
%S 469617,25900263,1567749888,100259781690,6556642024200,
%T 433165769694465,28770371143057311,1915604623565617890,
%U 127722868372348334343,8521820836493432131926,568800839142318486776736
%N Number of (n+1) X 8 0..2 arrays with the number of clockwise edge increases in 2 X 2 subblocks nondecreasing, and counterclockwise edge increases nonincreasing, rightwards and downwards.
%C Column 7 of A206542.
%H R. H. Hardin, <a href="/A206541/b206541.txt">Table of n, a(n) for n = 1..93</a>
%e Some solutions for n=4:
%e ..0..1..2..1..2..0..1..2....2..1..0..2..0..2..1..2....2..2..0..1..1..1..0..0
%e ..1..2..0..2..1..2..0..1....0..2..1..0..1..0..2..1....2..0..0..0..1..0..0..1
%e ..0..1..2..0..2..0..1..2....2..0..2..1..0..1..0..2....2..2..2..0..1..0..1..1
%e ..2..0..1..2..0..1..2..1....1..2..1..2..1..2..1..0....1..1..2..0..0..0..0..0
%e ..0..1..2..0..2..0..1..0....2..0..2..0..2..0..2..1....1..2..2..0..2..2..2..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 09 2012
|