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.

A267624 Number of n X n arrays containing n copies of 0..n-1 with every element equal to or 1 greater than any west neighbor modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 3, 39, 2386, 679735, 873319806, 4934982616333
Offset: 1

Views

Author

R. H. Hardin, Jan 18 2016

Keywords

Comments

Diagonal of A267629.

Examples

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

Crossrefs

Cf. A267629.