A267566 - OEIS

A267566

Number of nX(n+3) arrays of permutations of n+3 copies of 0..n-1 with every element equal to or 1 greater than any west or southwest neighbors modulo n and the upper left element equal to 0.

1, 126, 550, 11048, 392186, 21893719, 1883165721, 250936616799

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Superdiagonal 3 of A267562.

LINKS

Table of n, a(n) for n=1..8.

EXAMPLE

Some solutions for n=4

..0..1..2..3..3..0..0....0..0..0..1..1..1..2....0..0..1..2..3..3..3

..1..2..2..2..3..0..0....3..3..0..0..1..1..2....0..1..1..2..2..3..3

..1..1..1..2..3..0..0....3..3..3..0..1..2..3....1..1..1..2..2..3..0

..1..1..2..2..3..3..3....2..3..0..1..2..2..2....0..1..2..2..3..0..0

CROSSREFS

Cf. A267562.

Sequence in context: A202601 A202594 A245992 * A165023 A186825 A186817

Adjacent sequences: A267563 A267564 A267565 * A267567 A267568 A267569

KEYWORD

nonn

AUTHOR

R. H. Hardin, Jan 17 2016

STATUS

approved