The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #7 Dec 11 2015 11:53:22
%S 973388,3048096,10792800,157206240,1990281312,24408220320,
%T 373319837280,4839970998240,59527064527200,912767002149600,
%U 11833729090696800,145543672769004000,2231715320255772000,28933467626753676000
%N Number of (n+1) X 7 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.
%C Column 6 of A206118.
%H R. H. Hardin, <a href="/A206116/b206116.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 2445*a(n-3) for n>9.
%e Some solutions for n=4:
%e ..3..2..0..1..3..3..2....3..3..0..3..3..1..2....1..0..2..1..2..2..3
%e ..2..2..0..0..1..3..3....3..2..3..3..0..2..2....0..0..2..2..1..2..2
%e ..1..1..2..0..0..1..3....2..3..3..0..2..2..3....2..2..1..2..2..0..2
%e ..0..1..1..3..0..0..1....3..3..1..2..2..3..2....3..2..2..0..2..2..0
%e ..1..2..1..1..2..0..0....1..1..2..2..3..2..2....2..3..2..2..3..2..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 03 2012