|
|
A267337
|
|
Number of n X n arrays containing n copies of 0..n-1 with every element equal to or 1 greater than any north, west or southwest neighbors modulo n and the upper left element equal to 0.
|
|
1
|
|
|
1, 3, 5, 12, 36, 135, 649, 4277, 39472, 505780, 9112713
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..1..1..2....0..1..2..3....0..0..1..2....0..1..2..3....0..1..2..3
..0..1..2..3....0..1..2..3....0..1..2..3....1..2..3..0....1..1..2..3
..1..2..3..0....0..1..2..3....0..1..2..3....2..3..0..1....1..2..3..0
..2..3..3..0....1..2..3..0....1..2..3..3....2..3..0..1....2..3..0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|