|
%I #4 Dec 31 2013 06:36:02
%S 3843,161631,6566460,263929692,10572386472,423046102605,
%T 16922003634471,676811269740528,27068730475090632,1082588035969280076,
%U 43296916055230905366,1731610426247501412189,69253743854202407932599
%N Number of (n+1)X(3+1) 0..2 arrays with each 2X2 subblock having the number of clockwise edge increases less than or equal to the number of counterclockwise edge increases
%C Column 3 of A234832
%H R. H. Hardin, <a href="/A234827/b234827.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 69*a(n-1) -1465*a(n-2) +13735*a(n-3) -65766*a(n-4) +174137*a(n-5) -265580*a(n-6) +234847*a(n-7) -111244*a(n-8) +19238*a(n-9) +45*a(n-10) -6*a(n-11) +72*a(n-12) -9*a(n-13)
%e Some solutions for n=2
%e ..0..1..1..0....1..0..0..2....1..1..0..2....0..0..0..0....0..0..0..2
%e ..0..0..0..2....2..2..0..0....0..0..0..1....0..0..1..2....0..0..0..1
%e ..1..1..1..0....0..2..2..2....2..0..1..0....2..2..0..1....0..2..0..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 31 2013
| 