|
%I #7 Oct 09 2015 22:36:56
%S 8655,17532,80088,223560,1421976,4116576,25898472,76594212,491999118,
%T 1452775596,9287994096,27469736568,175992497334,520294935264,
%U 3331132695774,9849664194432,63077440686552,186500014153044
%N Number of (n+1)X5 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 Column 4 of A205736.
%H R. H. Hardin, <a href="/A205732/b205732.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 25*a(n-2) -97*a(n-4) -599*a(n-6) +5944*a(n-8) -21030*a(n-10) +40354*a(n-12) -42520*a(n-14) +13229*a(n-16) +28855*a(n-18) -48755*a(n-20) +36487*a(n-22) -13284*a(n-24) -138*a(n-26) +2402*a(n-28) -1064*a(n-30) +208*a(n-32) -16*a(n-34) for n>38.
%e Some solutions for n=4:
%e ..1..2..2..1..1....2..2..1..2..2....2..1..1..2..1....1..1..1..0..0
%e ..1..2..0..0..1....0..2..1..2..0....1..0..2..1..2....2..1..2..2..0
%e ..2..0..2..1..0....2..1..2..0..1....1..1..1..1..1....0..2..1..0..2
%e ..0..0..0..0..0....2..1..2..0..1....1..1..1..1..1....2..2..2..2..2
%e ..0..0..0..0..0....0..2..0..1..2....2..1..2..2..0....2..2..2..2..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 30 2012
| 