|
%I #7 Dec 10 2015 01:53:12
%S 52812,54432,86496,444480,2156544,10584000,56633472,279244800,
%T 1373929344,7362351360,36301824000,178610814720,957105676800,
%U 4719237120000,23219405913600,124423737984000,613500825600000,3018522768768000
%N Number of (n+1) X 7 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.
%C Column 6 of A206094.
%H R. H. Hardin, <a href="/A206092/b206092.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 130*a(n-3) for n>9.
%e Some solutions for n=4:
%e ..0..2..1..2..2..1..0....1..1..2..0..0..2..1....0..2..2..0..1..0..1
%e ..0..2..2..0..2..2..1....0..1..1..2..0..0..2....2..2..0..1..1..0..0
%e ..1..0..2..2..0..2..2....2..0..1..1..2..0..0....2..0..1..1..2..1..1
%e ..1..1..0..2..2..1..1....2..2..0..1..1..2..2....0..1..1..2..1..1..2
%e ..0..1..1..0..2..1..2....0..2..2..0..1..2..0....0..1..0..1..1..0..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 03 2012
| 