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.

A266182 Number of nX3 arrays containing 3 copies of 0..n-1 with no element plus any diagonal or antidiagonal neighbor equal to n-1.

Original entry on oeis.org

1, 2, 88, 7768, 4027960, 2437859280, 3971117183616, 6584104013616000
Offset: 1

Views

Author

R. H. Hardin, Dec 23 2015

Keywords

Comments

Column 3 of A266183.

Examples

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

Crossrefs

Cf. A266183.