The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #7 Dec 10 2015 01:54:14
%S 3564,5952,13344,48816,131904,444480,1645920,4484736,15112320,
%T 55961280,152481024,513818880,1902683520,5184354816,17469841920,
%U 64691239680,176268063744,593974625280,2199502149120,5993114167296,20195137259520
%N Number of (n+1) X 5 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.
%C Column 4 of A206094.
%H R. H. Hardin, <a href="/A206090/b206090.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 34*a(n-3) for n>7.
%e Some solutions for n=4:
%e ..0..2..1..2..0....1..2..2..1..0....2..2..0..0..1....1..2..2..0..1
%e ..2..1..1..2..2....0..1..2..2..1....1..1..2..0..0....2..0..2..2..0
%e ..1..1..2..0..0....0..0..1..2..2....0..1..1..2..0....2..2..0..2..2
%e ..1..2..0..0..2....2..0..0..1..2....1..2..1..1..2....1..2..2..1..2
%e ..2..0..0..1..0....0..1..0..0..1....1..1..2..1..2....2..1..2..2..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 03 2012