The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #6 Dec 10 2015 02:04:48
%S 33827496,258956760,4654724592,72541287824,1315300941940,
%T 22850275822056,451135236949228,8471569888552480,159117872993945456,
%U 3048070811440138488
%N Number of (n+1) X 8 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.
%C Column 7 of A205944.
%e Some solutions for n=4:
%e ..1..0..3..2..3..1..0..0....3..2..0..1..1..2..1..3....1..0..1..3..2..0..3..0
%e ..2..2..2..2..0..2..2..2....1..2..2..0..0..3..2..2....0..0..2..0..1..1..0..0
%e ..0..1..1..3..1..1..1..3....1..2..2..2..1..0..0..2....2..1..3..0..1..1..0..0
%e ..0..0..2..0..0..0..3..1....2..0..0..3..2..3..0..3....3..2..2..1..0..0..3..0
%e ..2..1..3..0..2..1..0..1....2..2..1..0..2..3..1..0....0..0..0..2..0..0..0..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 01 2012