T(n,k) is the number of (n+1) X (k+1) 0..2 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.
A203965
T(n,k) is the number of (n+1) X (k+1) 0..2 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.
Terms
- a(0) =32a(1) =121a(2) =121a(3) =447a(4) =851a(5) =447a(6) =1579a(7) =6586a(8) =6586a(9) =1579a(10) =5352a(11) =45307a(12) =144184a(13) =45307a(14) =5352a(15) =17559a(16) =276516a(17) =2774984a(18) =2774984a(19) =276516a(20) =17559a(21) =56219a(22) =1512850a(23) =45390107a(24) =157316750a(25) =45390107a(26) =1512850a(27) =56219a(28) =176797a(29) =7559349
External references
- oeis: A203965