|
%I #4 Dec 31 2013 06:36:43
%S 28602,2826144,263929692,24157113543,2194611652359,198813266559054,
%T 17991495416997300,1627464551425873818,147193282684219789893,
%U 13311853653618989194317,1203868850769998755908516
%N Number of (n+1)X(4+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 4 of A234832
%H R. H. Hardin, <a href="/A234828/b234828.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 182*a(n-1) -11600*a(n-2) +364517*a(n-3) -6574557*a(n-4) +74167355*a(n-5) -550713612*a(n-6) +2763264852*a(n-7) -9403512254*a(n-8) +21143341630*a(n-9) -28417525706*a(n-10) +11657297214*a(n-11) +38663386597*a(n-12) -104056918812*a(n-13) +134565850437*a(n-14) -58332448151*a(n-15) -136233194984*a(n-16) +312098619191*a(n-17) -313931961777*a(n-18) +175500893116*a(n-19) -48707250480*a(n-20) +560589885*a(n-21) +2754659691*a(n-22) +330478353*a(n-23) -654517260*a(n-24) +209271843*a(n-25) -30114261*a(n-26) +2018601*a(n-27) -59049*a(n-28)
%e Some solutions for n=1
%e ..0..2..2..1..1....2..0..0..2..0....1..0..1..0..1....0..0..2..1..0
%e ..2..2..2..0..1....2..2..2..0..1....2..1..2..1..2....1..2..0..2..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 31 2013
| 