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 #7 Dec 11 2015 11:47:33
%S 797996,241927532,75353928196,23692759265020,7476894104333060,
%T 2363085244017636372,747324517604795047052,236402993427571147646868,
%U 74790182365485126434100812,23662267614587185373925151692
%N Number of (n+1) X 7 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.
%C Column 6 of A206137.
%H R. H. Hardin, <a href="/A206135/b206135.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=4:
%e ..2..0..2..1..2..3..0....0..1..2..0..1..2..1....1..0..1..2..3..2..0
%e ..0..1..0..3..0..1..2....1..2..3..1..0..1..0....2..1..0..1..2..3..1
%e ..3..0..3..2..3..0..1....0..1..2..3..2..3..1....1..0..2..3..0..2..3
%e ..1..2..0..3..2..3..0....3..0..1..2..3..0..3....2..1..3..0..1..0..1
%e ..0..1..2..1..0..1..3....2..3..0..1..2..3..2....3..2..0..3..0..3..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 04 2012