|
%I #9 Jun 18 2018 12:29:17
%S 441,552,750,1272,2094,3408,5850,9792,15966,26880,45024,73656,123486,
%T 206976,339648,567600,951390,1565568,2610048,4373160,7213662,12005760,
%U 20102688,33227808,55236702,92416512,153013920,254174616,424902750
%N Number of (n+1) X 4 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly one clockwise edge increases.
%C Column 3 of A207050.
%H R. H. Hardin, <a href="/A207045/b207045.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 4*a(n-3) +a(n-4) for n>11.
%F Empirical g.f.: 3*x*(147 + 184*x + 250*x^2 - 164*x^3 - 185*x^4 - 48*x^5 + 4*x^6 + 48*x^7 + 80*x^8 + 24*x^9 + 2*x^10) / (1 - 4*x^3 - x^4). - _Colin Barker_, Jun 18 2018
%e Some solutions for n=4:
%e ..0..0..1..1....1..0..2..2....2..1..0..0....2..0..0..2....2..2..0..0
%e ..0..0..0..1....1..1..2..2....2..0..0..0....2..0..0..0....2..0..0..0
%e ..1..0..0..0....1..1..1..2....0..0..0..2....2..2..0..0....0..0..0..2
%e ..1..1..0..0....0..1..1..1....0..0..1..1....2..2..2..0....0..0..1..1
%e ..1..1..1..2....0..0..1..1....1..1..1..1....1..2..2..2....1..1..1..1
%Y Cf. A207050.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 14 2012
| 