|
|
A267201
|
|
Number of n X (n+5) arrays of permutations of n+5 copies of 0..n-1 with every element equal to or 1 greater than any north, southwest or northwest neighbors modulo n and the upper left element equal to 0.
|
|
0
|
|
|
1, 1716, 121, 336, 3337, 44525, 641925, 9242494, 130348644, 1783844726, 23607637070
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..0..1..1..1..2..2..3..3....0..1..1..2..2..3..3..3..0
..0..0..1..1..2..2..2..3..3....1..1..1..2..2..3..3..0..0
..0..0..1..1..2..2..3..3..3....1..1..2..2..2..3..3..0..0
..0..0..1..1..2..2..3..3..0....1..1..2..2..3..3..0..0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|