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.

A266453 Number of nX3 arrays containing 3 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, 0, 39, 6152, 2079765, 1362641028, 1511484069811, 2623713101882928, 6717410044413848265
Offset: 1

Views

Author

R. H. Hardin, Dec 29 2015

Keywords

Comments

Column 3 of A266455.

Examples

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

Crossrefs

Cf. A266455.