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.

A266571 Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its northwest or southwest neighbor modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 1, 15, 2320, 729874, 466056593, 515679132204, 897699718056452
Offset: 1

Views

Author

R. H. Hardin, Jan 01 2016

Keywords

Comments

Column 3 of A266572.

Examples

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

Crossrefs

Cf. A266572.