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.

A265371 Number of nX3 arrays containing 3 copies of 0..n-1 with no equal horizontal, vertical or antidiagonal neighbors and new values introduced sequentially from 0.

Original entry on oeis.org

0, 0, 1, 32, 4954, 878953, 192333677, 53404173562, 18545695848787, 7914432322153846
Offset: 1

Views

Author

R. H. Hardin, Dec 07 2015

Keywords

Comments

Column 3 of A265373.

Examples

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

Crossrefs

Cf. A265373.