A267283 Number of nX(n+4) arrays of permutations of n+4 copies of 0..n-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, 462, 13767, 741057, 79348962, 13687472182
Offset: 1
Keywords
Examples
Some solutions for n=3 ..0..0..0..1..2..2..0....0..1..2..0..0..1..2....0..0..1..1..2..2..0 ..0..0..1..1..1..2..0....1..1..2..2..0..1..2....0..1..1..2..2..0..0 ..2..1..1..1..2..2..2....0..1..2..0..0..1..2....1..0..2..1..2..2..1
Crossrefs
Cf. A267278.
Comments