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

1, 35, 11, 23, 47, 92, 166, 285, 460, 717, 1068, 1554, 2187, 3026, 4082, 5436

Offset

1,2

Comments

Superdiagonal 2 of A267197.

Links

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

Example

Some solutions for n=4
..0..1..2..3..3..0....0..1..2..2..3..0....0..1..1..2..3..0....0..1..1..2..3..3
..1..1..2..3..0..0....1..1..2..3..3..0....0..1..2..2..3..0....0..1..1..2..3..3
..1..2..2..3..0..1....1..1..2..3..3..0....1..1..2..3..3..0....0..1..2..2..3..0
..2..2..3..3..0..1....1..2..2..3..0..0....1..2..2..3..3..0....0..1..2..2..3..0

Crossrefs

Cf. A267197.

Sequence in context: A277079 A248477 A051050 * A267140 A348893 A088830

Adjacent sequences: A267195 A267196 A267197 * A267199 A267200 A267201

Keyword

nonn

Author

R. H. Hardin, Jan 11 2016

Status

approved