|
%I
%S 5085012,3340355572,2268967605164,1560344155530612,
%T 1078605317680077404,747324517604795047052,518342328616619031217028,
%U 359698014444415101581399772,249665914107637738650774896468
%N Number of (n+1) X 8 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.
%C Column 7 of A206137.
%H R. H. Hardin, <a href="/A206136/b206136.txt">Table of n, a(n) for n = 1..75</a>
%e Some solutions for n=4:
%e ..1..0..1..2..0..3..1..2....1..2..1..3..0..3..0..2....2..1..3..2..0..1..0..1
%e ..2..1..2..0..2..1..3..1....2..3..2..0..3..0..1..3....3..2..1..3..1..3..2..3
%e ..1..0..1..3..1..2..0..2....3..0..3..2..0..1..2..0....2..3..2..1..2..1..3..0
%e ..3..1..0..1..3..1..2..3....0..3..1..0..3..0..1..2....1..2..3..2..1..2..0..3
%e ..0..2..1..3..2..3..0..2....1..0..2..1..0..1..0..1....2..0..1..3..2..1..3..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 04 2012
| 