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.

A266454 Number of nX4 arrays of permutations of 4 copies of 0..n-1 with no element 1 greater than its north neighbor modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 3, 357, 442285, 1548940233, 12959331192279, 218375094825289861
Offset: 1

Views

Author

R. H. Hardin, Dec 29 2015

Keywords

Comments

Column 4 of A266455.

Examples

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

Crossrefs

Cf. A266455.