|
|
A267329
|
|
Number of nX(n+1) arrays of permutations of n+1 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.
|
|
0
|
|
|
1, 10, 15, 22, 30, 38, 46, 54, 62, 70, 78, 86
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..1..2..3..0....0..1..2..3..0....0..0..1..1..2....0..1..2..3..0
..0..1..2..3..3....0..1..2..3..0....3..0..1..2..2....1..1..2..3..0
..0..1..2..2..3....1..1..2..3..0....3..0..1..2..3....1..2..2..3..0
..0..1..1..2..3....1..2..2..3..3....3..0..1..2..3....1..2..3..3..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|