login
A267340
Number of nX(n+1) arrays of permutations of n+1 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.
0
1, 10, 11, 45, 264, 2192, 25661, 418273, 9498724
OFFSET
1,2
COMMENTS
Superdiagonal 1 of A267338.
EXAMPLE
Some solutions for n=4
..0..1..2..3..0....0..1..2..2..3....0..1..2..2..3....0..1..2..3..0
..1..2..2..3..0....0..1..2..3..3....0..1..2..3..0....1..2..3..0..1
..1..2..3..0..1....1..1..2..3..0....1..2..3..3..0....2..3..0..1..2
..2..3..3..0..1....1..2..3..0..0....1..2..3..0..1....3..0..1..2..3
CROSSREFS
Cf. A267338.
Sequence in context: A280203 A042395 A041210 * A344082 A042413 A041212
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 13 2016
STATUS
approved