|
%I #4 Dec 30 2013 19:28:53
%S 30536,3015344,280996212,25695321008,2334950105532,211733037460400,
%T 19186434495264308,1738191883121101472,157458806627700653996,
%U 14263455372346522807504,1292048182581018711385700
%N Number of (n+1)X(3+1) 0..3 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 A234796
%H R. H. Hardin, <a href="/A234791/b234791.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 174*a(n-1) -10322*a(n-2) +299192*a(n-3) -4916088*a(n-4) +49495654*a(n-5) -320524051*a(n-6) +1381581872*a(n-7) -4047000461*a(n-8) +7991340866*a(n-9) -9739200284*a(n-10) +4224246488*a(n-11) +8026590994*a(n-12) -17876492846*a(n-13) +17714584733*a(n-14) -10616721904*a(n-15) +4045200724*a(n-16) -893202136*a(n-17) +59914260*a(n-18) -25923040*a(n-19) +42766000*a(n-20) -12448000*a(n-21)
%e Some solutions for n=1
%e ..0..1..1..3....2..2..1..0....3..2..1..1....2..0..2..0....0..1..2..1
%e ..0..1..2..3....0..0..0..1....2..3..1..3....2..0..0..3....1..2..1..3
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 30 2013
| 