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.

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

Original entry on oeis.org

1, 10, 59, 759, 18157, 912057, 100710495
Offset: 1

Views

Author

R. H. Hardin, Jan 09 2016

Keywords

Comments

Superdiagonal 1 of A267019.

Examples

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

Crossrefs

Cf. A267019.