|
%I #7 Dec 11 2015 21:28:01
%S 7854572,406202048,78597249508,23825180259760,7481908870312588,
%T 2363371012699739212,747343697917253418576,236405079530904298698860,
%U 74790605792946446088286728,23662388118003270037770957312
%N Number of (n+1) X 7 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 6 of A206188.
%H R. H. Hardin, <a href="/A206186/b206186.txt">Table of n, a(n) for n = 1..23</a>
%e Some solutions for n=4:
%e ..1..2..0..1..0..0..0....0..1..1..0..0..3..3....0..2..3..2..1..0..3
%e ..2..2..0..1..0..1..0....0..0..1..1..3..3..0....2..1..1..3..2..1..0
%e ..1..2..0..0..0..1..0....2..0..1..2..3..0..0....1..3..2..0..3..2..1
%e ..1..2..2..0..1..1..0....1..0..3..3..2..2..1....2..3..3..0..1..2..3
%e ..1..1..2..0..0..0..0....0..0..3..0..2..1..1....1..2..0..3..0..1..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 04 2012
| 