|
|
A267741
|
|
Number of nX7 arrays of permutations of 7 copies of 0..n-1 with every element equal to or 1 greater than any west or northeast neighbors modulo n and the upper left element equal to 0.
|
|
0
|
|
|
1, 1716, 3057, 18899, 114323, 649089, 3562990, 19473397, 106720862, 587093497, 3242425329, 17979553213, 100111504811, 559802224778, 3143926483262, 17734833870688, 100488091104948
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..0..1..1..2..2..2....0..1..2..2..3..3..0....0..0..0..1..1..2..2
..1..2..2..2..3..3..0....1..2..3..0..0..1..2....1..1..1..1..2..3..3
..3..3..3..0..0..0..1....3..0..0..1..1..2..3....1..2..2..2..3..3..0
..3..3..0..1..1..1..2....1..1..2..2..3..3..0....2..3..3..3..0..0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|