|
|
A266630
|
|
Number of nX2 arrays containing 2 copies of 0..n-1 with no element 1 greater than its north, west, southeast or southwest neighbor modulo n and the upper left element equal to 0.
|
|
0
|
|
|
1, 0, 1, 13, 139, 7623, 585112, 60695930, 8247622671, 1413690625856, 298076685938894
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..2....0..3....0..2....0..2....0..2....0..2....0..2....0..3....0..2....0..3
..2..0....3..1....3..1....0..2....0..2....2..0....2..1....3..2....3..2....0..2
..1..3....2..1....2..0....3..1....3..1....1..3....1..3....2..1....3..1....2..1
..1..3....2..0....1..3....3..1....1..3....3..1....0..3....1..0....1..0....1..3
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|