|
%I #7 Dec 10 2015 01:53:43
%S 13608,17976,33792,131904,516912,2156544,8613504,34039392,142331904,
%T 568491264,2246599872,9393905664,37520423424,148275591552,
%U 619997773824,2476347945984,9786189042432,40919853072384,163438964434944
%N Number of (n+1) X 6 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.
%C Column 5 of A206094.
%H R. H. Hardin, <a href="/A206091/b206091.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 66*a(n-3) for n>8.
%e Some solutions for n=4:
%e ..1..1..2..1..2..1....1..0..1..2..2..0....2..2..0..2..2..0....1..2..2..1..2..2
%e ..1..0..1..1..2..2....1..0..0..1..2..2....2..0..2..2..0..1....2..1..2..2..0..2
%e ..0..1..1..0..1..1....0..2..0..0..1..2....0..2..2..0..1..1....2..2..0..2..2..0
%e ..1..1..2..1..1..0....0..0..1..0..0..1....2..2..0..1..1..2....1..2..2..0..2..2
%e ..2..2..1..1..2..1....2..0..0..2..0..1....2..0..1..1..2..1....2..0..2..2..1..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 03 2012
| 