|
%I #7 Dec 11 2015 11:49:00
%S 3092,91924,2761756,83120732,2502596196,75353928196,2268967605164,
%T 68320694237116,2057200342508100,61944247178059108,
%U 1865199913242292140,56162935264244462556,1691119155959930890244,50921198959363203903524
%N Number of (n+1) X 4 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.
%C Column 3 of A206137.
%H R. H. Hardin, <a href="/A206132/b206132.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 46*a(n-1) -573*a(n-2) +3120*a(n-3) -8589*a(n-4) +11686*a(n-5) -4877*a(n-6) -5572*a(n-7) +6702*a(n-8) -1664*a(n-9) -390*a(n-10) +112*a(n-11).
%e Some solutions for n=4:
%e ..1..0..1..0....1..3..2..3....2..0..2..3....0..2..0..1....0..1..0..1
%e ..2..1..2..1....3..1..3..2....1..2..0..1....3..1..2..0....2..3..1..3
%e ..1..0..1..2....1..2..0..3....2..3..1..2....2..3..0..1....3..1..0..1
%e ..0..2..3..0....3..0..3..1....3..1..2..3....0..1..2..3....0..3..1..2
%e ..1..3..0..3....0..1..0..2....0..3..0..1....1..3..0..1....1..0..2..3
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 04 2012
| 