The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #5 Mar 31 2012 12:36:58
%S 131432,77658673,74956749750,58500223468696,36337203300044690,
%T 18604524788467098072,8110443447372955603425,
%U 3082791332479309543066942,1039925175573588479732712925,315587592566984720012990188344
%N Number of (n+1)X5 0..4 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing
%C Column 4 of A203896
%H R. H. Hardin, <a href="/A203892/b203892.txt">Table of n, a(n) for n = 1..70</a>
%e Some solutions for n=4
%e ..2..4..3..3..3....2..1..0..0..2....1..4..4..3..3....0..1..4..3..4
%e ..3..3..4..4..4....0..3..4..4..3....3..3..3..4..4....2..1..0..3..4
%e ..2..4..4..4..4....0..3..4..4..3....4..2..4..4..4....1..2..3..4..3
%e ..3..4..2..4..4....3..2..0..3..3....2..4..3..3..3....0..3..3..2..4
%e ..3..4..4..1..2....1..4..3..1..0....4..3..4..1..1....4..4..4..3..4
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 07 2012