cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A267282 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 southwest or northwest neighbors modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 126, 2840, 104742, 5977624, 466131976
Offset: 1

Views

Author

R. H. Hardin, Jan 12 2016

Keywords

Comments

Superdiagonal 3 of A267278.

Examples

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

Crossrefs

Cf. A267278.