login
A267339
Number of (n+1)Xn arrays containing n copies of 0..n+1-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, 1, 2, 2, 4, 9, 24, 89, 594, 4086, 39921
OFFSET
1,3
COMMENTS
Subdiagonal 1 of A267338.
EXAMPLE
Some solutions for n=7
..0..1..2..3..4..4..5....0..0..1..1..2..2..3....0..1..2..3..4..4..5
..1..2..3..3..4..5..6....0..0..1..1..2..3..4....1..2..3..3..4..5..6
..2..2..3..4..5..6..7....0..0..1..2..3..4..5....2..3..3..4..5..6..7
..2..3..4..5..6..7..0....0..1..2..3..4..5..6....2..3..4..5..6..7..0
..3..4..5..6..7..0..1....1..2..3..4..5..6..7....3..4..5..6..7..0..1
..4..5..6..7..0..1..1....2..3..4..5..6..6..7....4..5..6..7..0..1..2
..5..6..7..0..0..1..2....3..4..5..6..6..7..7....5..6..7..0..0..1..2
..6..7..7..0..1..2..3....4..5..5..6..7..7..7....6..7..7..0..1..1..2
CROSSREFS
Cf. A267338.
Sequence in context: A166022 A052925 A006182 * A308434 A121623 A267347
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 13 2016
STATUS
approved