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.

A267020 Number of (n+1)Xn arrays containing n copies of 0..n 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, 5, 21, 259, 5493, 255437, 26320280, 6071784885
Offset: 1

Views

Author

R. H. Hardin, Jan 09 2016

Keywords

Comments

Subdiagonal 1 of A267019.

Examples

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

Crossrefs

Cf. A267020.