|
|
A219679
|
|
Number of n X n arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X n array
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3
..1..0..0....1..0..0....1..1..0....2..0..0....0..0..0....1..0..0....0..0..0
..1..0..0....1..0..0....1..0..0....2..0..0....0..0..0....0..0..0....0..0..0
..1..1..2....2..2..2....2..0..0....2..2..2....2..2..2....0..0..1....2..1..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|