A267279 Number of (n+1)Xn arrays containing n copies of 0..n+1-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.
1, 5, 24, 293, 6240, 315356, 33284502
Offset: 1
Keywords
Examples
Some solutions for n=4 ..0..2..1..4....0..3..1..4....0..4..2..1....0..3..1..0....0..3..1..0 ..2..0..3..1....2..0..3..1....3..1..0..3....3..1..4..2....3..1..4..2 ..4..2..0..3....4..2..0..3....1..4..2..1....1..4..2..4....0..3..2..4 ..1..4..3..1....1..4..2..1....4..2..0..3....3..1..4..2....3..1..4..2 ..3..2..0..4....4..2..0..3....2..4..3..0....0..3..2..0....1..4..2..0
Crossrefs
Cf. A267278.
Comments