|
%I #7 Dec 11 2015 11:54:13
%S 31756,111552,520800,5048352,21702240,157206240,1542266208,6705992160,
%T 48576728160,476560258272,2072151577440,15010209001440,
%U 147257119806048,640294837428960,4638154581444960,45502450020068832,197851104765548640
%N Number of (n+1) X 5 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.
%C Column 4 of A206118.
%H R. H. Hardin, <a href="/A206114/b206114.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 309*a(n-3) for n>7.
%e Some solutions for n=4:
%e ..0..1..3..2..3....1..3..3..0..3....0..0..2..1..1....3..1..2..3..3
%e ..1..3..3..2..2....0..1..3..3..1....2..0..0..2..1....3..1..1..2..3
%e ..3..3..2..0..0....0..0..1..3..3....3..2..0..0..3....1..2..1..1..2
%e ..1..1..0..0..1....3..0..0..2..2....3..3..1..0..0....1..1..3..1..1
%e ..2..1..0..1..2....1..2..0..2..3....2..3..3..1..0....2..1..1..2..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 03 2012
| 