|
|
A267739
|
|
Number of nX5 arrays of permutations of 5 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.
|
|
1
|
|
|
1, 126, 207, 633, 1811, 4997, 13856, 38736, 109231, 310419, 888448, 2558995, 7412354, 21577360, 63084725, 185133501, 545075812, 1609314717, 4762800580, 14124361768, 41959331051, 124832686231, 371852935856, 1108854732663
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..1..1..2..2....0..1..2..2..2....0..0..0..1..2....0..1..1..2..3
..1..1..2..2..3....1..2..3..3..3....1..1..2..3..3....2..2..3..0..0
..2..3..3..3..3....3..0..0..0..1....2..2..3..0..1....3..0..1..1..2
..0..0..0..0..1....0..1..1..2..3....3..3..0..1..2....0..1..2..3..3
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|