|
%I #7 Oct 09 2015 22:33:10
%S 7572,9198,39450,223560,1302228,7713324,46226928,279659868,1704880890,
%T 10462876284,64585503408,400746023364,2498045547126,15635322145932,
%U 98216084782716,618928949286996,3911199907193244,24776252730392748
%N Number of 5X(n+1) 0..2 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.
%C Row 4 of A205736.
%H R. H. Hardin, <a href="/A205740/b205740.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 14*a(n-1) -28*a(n-2) -369*a(n-3) +1414*a(n-4) +3701*a(n-5) -19990*a(n-6) -18379*a(n-7) +145521*a(n-8) +47333*a(n-9) -637510*a(n-10) -56726*a(n-11) +1796078*a(n-12) +22442*a(n-13) -3352104*a(n-14) -57742*a(n-15) +4171256*a(n-16) +261182*a(n-17) -3411792*a(n-18) -421206*a(n-19) +1765491*a(n-20) +322860*a(n-21) -537304*a(n-22) -123513*a(n-23) +83415*a(n-24) +21351*a(n-25) -4710*a(n-26) -1188*a(n-27) for n>31.
%e Some solutions for n=4:
%e ..2..0..0..2..1....2..1..1..2..1....1..2..2..1..1....0..0..2..0..2
%e ..2..2..2..2..2....1..0..2..1..2....1..2..0..0..1....1..0..2..0..2
%e ..2..2..2..2..2....1..1..1..1..1....2..0..2..1..0....2..1..0..2..0
%e ..2..1..2..0..2....1..1..1..1..1....0..0..0..0..0....2..1..0..2..0
%e ..0..2..0..1..0....2..1..2..2..0....0..0..0..0..0....0..2..1..0..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 30 2012
| 