|
%I #5 Mar 31 2012 12:37:09
%S 114770680,805817696,8150091296,144759802024,4049733446192,
%T 116754537442024,3548796740666104,104913330043385544,
%U 3100102797454726928,94947677256651902408,2808896482891396276872,82969400940350314916464
%N Number of (n+1)X8 0..3 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases
%C Column 7 of A206063
%H R. H. Hardin, <a href="/A206062/b206062.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 26761*a(n-3) +573*a(n-5) for n>16
%e Some solutions for n=4
%e ..2..2..1..2..3..3..0..3....1..0..0..2..0..1..1..2....1..3..2..2..3..2..0..0
%e ..0..3..1..1..2..3..3..0....2..3..2..2..3..3..0..1....1..0..1..3..3..0..1..1
%e ..0..0..3..1..1..2..3..3....1..2..2..0..3..3..1..1....1..2..3..3..0..1..1..0
%e ..1..0..0..2..1..1..2..3....2..2..3..1..2..1..1..3....1..3..3..0..1..1..2..1
%e ..2..1..0..0..2..1..1..1....0..0..0..0..1..1..3..1....2..3..0..1..1..2..1..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 03 2012
| 