|
%I #5 Feb 15 2014 13:35:19
%S 256,1768,12441,88964,636720,4539422,32392585,231168380,1651386880,
%T 11781707484,84133281516,600305505960,4287360280804,30589999124616,
%U 218462455254332,1558732440419296,11132074626065648,79427162629506432
%N Number of (n+1)X(1+1) 0..3 arrays with the maximum plus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
%C Column 1 of A237904
%H R. H. Hardin, <a href="/A237899/b237899.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 1784*a(n-4) +39800*a(n-6) +151364*a(n-8) -3049440*a(n-10) -26111208*a(n-12) +14962784*a(n-14) +687231488*a(n-16) +1360519984*a(n-18) -4184091008*a(n-20) -12843568640*a(n-22) +1638036736*a(n-24) +9279855360*a(n-26) -23629565952*a(n-28) +19040813056*a(n-30) +44134580224*a(n-32) -27197440000*a(n-34) -25461784576*a(n-36) +7525629952*a(n-38) +2793406464*a(n-40) for n>41
%e Some solutions for n=4
%e ..0..1....2..0....1..1....2..1....3..3....0..0....1..0....3..0....0..2....0..3
%e ..2..0....3..0....3..1....0..3....3..2....3..2....0..3....0..3....1..3....2..0
%e ..0..2....0..3....1..2....1..0....2..0....3..2....0..0....1..2....3..0....1..2
%e ..1..1....2..0....0..1....2..3....2..2....2..2....2..2....2..3....2..0....2..2
%e ..0..1....0..2....1..1....1..1....0..3....1..3....2..3....2..2....1..2....3..3
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 15 2014
| 