|
|
A203961
|
|
Number of (n+1)X5 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
|
|
1
|
|
|
1579, 45307, 2774984, 157316750, 7594654075, 307121002440, 10649020852202, 323057300197928, 8726668452309006, 212841486133370354, 4739849013582481100, 97256290892559264697, 1852532779115705386166, 32962761352984953106390
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..2..1..1..1..1....2..2..2..2..2....0..1..2..1..0....1..1..2..1..1
..1..2..2..2..2....2..2..2..2..2....1..1..0..1..2....1..2..1..2..2
..2..2..2..2..2....2..2..2..2..2....1..1..2..1..1....2..1..2..2..2
..2..2..2..2..2....2..2..2..2..2....0..2..1..2..2....1..2..2..2..2
..2..2..2..2..2....2..2..2..2..2....2..1..2..2..1....1..2..2..2..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|