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.

A267626 Number of nX3 arrays containing 3 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, 10, 39, 208, 1576, 14830, 168500, 2247280, 34423760, 596248800, 11529957600, 246360114000
Offset: 1

Views

Author

R. H. Hardin, Jan 18 2016

Keywords

Comments

Column 3 of A267629.

Examples

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

Crossrefs

Cf. A267629.