A267280 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 southwest or northwest neighbors modulo n and the upper left element equal to 0.
1, 10, 109, 1138, 18276, 663855, 55479601, 12194740046
Offset: 1
Keywords
Examples
Some solutions for n=4 ..0..3..2..1..0....0..2..1..3..2....0..3..2..0..0....0..3..2..1..3 ..2..1..0..3..1....2..1..3..1..0....2..1..0..3..1....3..1..0..2..1 ..1..3..2..0..0....0..3..1..3..2....1..3..2..1..3....0..3..1..1..3 ..2..2..3..3..1....2..0..3..1..0....2..2..0..3..1....2..0..0..2..2
Crossrefs
Cf. A267278.
Comments