|
%I #4 Feb 06 2014 06:41:16
%S 1980,41220,821234,17627820,380945760,8406402902,187274820848,
%T 4212082221444,95349805566302,2169810608997912,49567582138584820,
%U 1135678343874996398,26077450896771261320,599775893998365758200
%N Number of (n+1)X(2+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock equal
%C Column 2 of A237340
%H R. H. Hardin, <a href="/A237334/b237334.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 47*a(n-1) -506*a(n-2) -5350*a(n-3) +119418*a(n-4) -292491*a(n-5) -5769290*a(n-6) +38319506*a(n-7) +16591825*a(n-8) -782193687*a(n-9) +1731908806*a(n-10) +3853403204*a(n-11) -18163240306*a(n-12) +6781065371*a(n-13) +52909631318*a(n-14) -59067161032*a(n-15) -56301011344*a(n-16) +103756990512*a(n-17) +14034541408*a(n-18) -73613340160*a(n-19) +8403519488*a(n-20) +22531661824*a(n-21) -3926882304*a(n-22) -2687410176*a(n-23) +403046400*a(n-24) +86507520*a(n-25)
%e Some solutions for n=2
%e ..0..3..0....1..0..2....1..3..0....2..3..0....1..0..3....3..2..0....0..3..0
%e ..2..3..1....3..3..1....0..3..3....3..0..2....0..3..3....1..0..3....1..0..2
%e ..0..2..0....2..0..3....3..0..2....2..2..3....0..0..0....3..0..3....1..3..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 06 2014
| 