|
|
A222000
|
|
Number of n X n arrays with each row a permutation of 1..n having at least as many downsteps as the preceding row, with rows in lexicographically nonincreasing order
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3
..2..1..3....2..3..1....2..3..1....3..1..2....3..1..2....2..3..1....2..1..3
..2..1..3....2..3..1....2..1..3....2..1..3....3..1..2....2..3..1....2..1..3
..1..3..2....2..3..1....1..3..2....2..1..3....3..1..2....1..3..2....2..1..3
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|