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 13 2015 21:23:16
%S 93696,1809324,41876592,965476188,22293930744,514286765952,
%T 11814420790656,271625729217060,6242906689405200,143498728805999472,
%U 3298292292638564196,75816561136802863356,1742726437095710308428
%N Number of (n+1) X 7 0..2 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases.
%C Column 6 of A206685.
%H R. H. Hardin, <a href="/A206683/b206683.txt">Table of n, a(n) for n = 1..124</a>
%e Some solutions for n=4:
%e ..0..1..2..2..0..1..1....2..1..0..2..1..2..2....2..0..1..0..1..1..1
%e ..2..1..1..0..0..2..1....1..1..2..2..0..1..0....0..2..1..0..2..2..0
%e ..0..2..0..1..2..2..0....0..2..0..1..2..1..0....0..1..2..2..0..1..2
%e ..1..1..2..1..1..0..2....0..2..1..0..0..2..2....1..0..2..1..0..1..0
%e ..0..0..0..2..0..1..1....0..1..2..2..0..1..1....2..2..2..0..0..2..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 11 2012