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.

A267279 Number of (n+1)Xn arrays containing n copies of 0..n+1-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, 5, 24, 293, 6240, 315356, 33284502
Offset: 1

Views

Author

R. H. Hardin, Jan 12 2016

Keywords

Comments

Subdiagonal 1 of A267278.

Examples

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

Crossrefs

Cf. A267278.