Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Dec 11 2015 21:27:32
%S 62623348,5614757320,2345626036136,1565902419680820,
%T 1078848431799509828,747343697917253418576
%N Number of (n+1) X 8 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 7 of A206188.
%e Some solutions for n=4:
%e ..1..1..3..1..1..3..1..0....0..1..0..1..1..0..1..0....1..3..2..1..3..0..2..2
%e ..0..2..1..3..2..1..0..2....0..0..0..1..2..0..0..0....2..2..2..1..3..0..2..1
%e ..0..0..1..2..2..3..0..1....3..3..0..1..2..3..3..3....3..1..1..1..3..0..2..2
%e ..3..1..0..1..3..0..1..0....2..1..0..3..3..2..1..0....0..0..0..1..3..0..0..0
%e ..2..2..1..0..0..2..0..1....1..1..0..3..0..2..1..0....1..3..0..1..3..3..3..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 04 2012