The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #7 Dec 11 2015 21:24:00
%S 19509,35922,133866,495858,2243139,8405508,33297948,125846844,
%T 520171458,2032882188,8441030760,32995135068,137694091206,
%U 538836368046,2242526518020,8781930040704,36621430354950,143540058923604
%N Number of (n+1) X 6 0..2 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 5 of A206277.
%H R. H. Hardin, <a href="/A206274/b206274.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=4:
%e ..2..0..1..1..0..1....0..0..2..0..0..1....1..2..1..1..0..1....2..1..1..2..2..0
%e ..2..1..2..2..1..1....0..1..0..0..0..1....1..0..2..2..1..1....1..0..0..1..1..2
%e ..1..2..2..2..1..1....2..0..0..0..1..0....2..1..2..2..1..1....1..0..0..1..1..2
%e ..1..2..2..0..2..0....2..0..0..1..2..2....0..1..1..0..2..0....2..1..1..0..0..1
%e ..2..0..0..1..2..2....0..1..1..2..2..2....0..0..2..1..2..0....1..1..1..0..0..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 05 2012