|
|
A266859
|
|
Number of nX2 arrays containing 2 copies of 0..n-1 with no element 1 greater than its north or southwest neighbor modulo n and the upper left element equal to 0.
|
|
0
|
|
|
1, 0, 4, 39, 1281, 67240, 5126572, 531096757, 71602080252, 12170470180300, 2544668908965896, 641689032354740060
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..3....0..2....0..1....0..2....0..0....0..2....0..2....0..2....0..1....0..3
..3..2....0..2....2..0....3..1....2..3....3..2....0..1....3..1....2..0....0..1
..2..1....3..1....1..3....3..1....1..3....3..1....2..3....3..0....2..3....2..1
..1..0....1..3....3..2....2..0....1..2....1..0....1..3....1..2....1..3....2..3
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|