|
|
A266597
|
|
Number of nX2 arrays containing 2 copies of 0..n-1 with no element 1 greater than its north or northeast neighbor modulo n and the upper left element equal to 0.
|
|
0
|
|
|
1, 0, 2, 38, 1197, 64497, 4975742, 519665920, 70425165645, 12012958306121, 2518082525423953, 636165450001831755
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..2....0..0....0..1....0..1....0..3....0..1....0..1....0..3....0..2....0..1
..2..1....2..3....3..0....3..3....2..2....3..0....3..1....2..2....0..1....0..3
..1..0....1..3....3..2....2..2....1..1....2..3....3..0....1..1....3..3....3..2
..3..3....1..2....1..2....1..0....0..3....2..1....2..2....3..0....1..2....2..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|