login
Number of (n+1)X5 0..5 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
1

%I #5 Mar 31 2012 12:36:58

%S 680400,1162808408,2904393889106,5669049948955178,8737138311717893143,

%T 11090877737628357276195,11988542045840411405835744,

%U 11300596116807754143327229001,9453923215027903987303752123258

%N Number of (n+1)X5 0..5 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 A203714

%H R. H. Hardin, <a href="/A203713/b203713.txt">Table of n, a(n) for n = 1..21</a>

%e Some solutions for n=4

%e ..2..1..4..0..5....3..0..1..3..4....4..5..5..5..5....0..1..5..3..2

%e ..0..4..1..5..3....1..5..4..2..2....4..5..5..5..5....3..2..1..3..4

%e ..2..2..5..2..4....5..2..3..5..4....4..5..5..5..5....0..5..3..3..2

%e ..0..4..3..4..3....4..3..4..2..0....5..5..5..5..5....3..3..4..2..4

%e ..1..3..4..5..5....5..3..0..2..3....5..5..5..5..5....2..4..3..3..3

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 04 2012