|
%I #4 Nov 24 2014 20:48:51
%S 110,700,3958,21326,110546,559824,2787971,13727380,67045240,325579124,
%T 1574538204,7592038724,36528105991,175474939818,841989538667,
%U 4036786501423,19341925776125,92633804040283,443503464714699
%N Number of (n+1)X(1+1) 0..3 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction
%C Column 1 of A250536
%H R. H. Hardin, <a href="/A250529/b250529.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 10*a(n-1) -25*a(n-2) -30*a(n-3) +166*a(n-4) -43*a(n-5) -343*a(n-6) +230*a(n-7) +301*a(n-8) -287*a(n-9) -110*a(n-10) +159*a(n-11) +5*a(n-12) -41*a(n-13) +6*a(n-14) +4*a(n-15) -a(n-16)
%e Some solutions for n=5
%e ..0..0....1..0....1..0....0..2....0..0....0..0....0..1....0..1....1..1....0..2
%e ..2..3....0..1....0..2....2..0....0..1....0..0....0..2....1..1....0..3....2..2
%e ..0..3....1..1....0..2....0..2....0..2....0..0....2..3....2..2....0..3....2..3
%e ..3..3....3..2....2..2....2..2....2..1....0..1....1..3....0..2....1..3....2..3
%e ..3..3....1..3....2..2....0..2....1..2....0..1....2..3....2..3....2..3....0..3
%e ..0..3....3..3....0..3....2..3....3..2....0..1....3..2....1..3....2..3....1..3
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 24 2014
| 