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.

A266157 Number of nX3 arrays containing 3 copies of 0..n-1 with no element plus any horizontal, vertical or antidiagonal neighbor equal to n-1.

Original entry on oeis.org

0, 0, 0, 40, 85976, 55409952, 118728695856, 185137301064192, 762943408126138752
Offset: 1

Views

Author

R. H. Hardin, Dec 22 2015

Keywords

Comments

Column 3 of A266158.

Examples

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

Crossrefs

Cf. A266158.