|
|
A250699
|
|
Number of (n+1)X(n+1) 0..3 arrays with nondecreasing 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
|
|
0
|
|
|
100, 4958, 301632, 19962956, 1325146542, 85271480338, 5300798582250, 321304832475298, 19214828391609706, 1144064129571045403, 68214697806201152135, 4084627265006830276517
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=2
..0..0..1....0..0..1....0..0..0....0..0..1....0..0..2....0..0..1....1..2..1
..0..0..2....0..1..2....0..3..1....0..1..1....0..1..2....0..0..1....2..1..3
..0..0..3....3..1..2....2..1..3....1..0..2....2..3..3....1..3..3....1..2..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|