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.

A267750 Number of nX5 arrays of permutations of 5 copies of 0..n-1 with every element equal to or 1 greater than any north neighbor modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 126, 3471, 54956, 679735, 7280046, 69784981, 619463736
Offset: 1

Views

Author

R. H. Hardin, Jan 20 2016

Keywords

Comments

Column 5 of A267751.

Examples

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

Crossrefs

Cf. A267751.