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.

A264941 Number of nX3 arrays containing 3 copies of 0..n-1 with no equal horizontal neighbors and new values introduced sequentially from 0.

Original entry on oeis.org

0, 1, 56, 3201, 307016, 43200625, 8403205056, 2162875665601, 712215325718576, 292162814336854881, 146127700393451369000
Offset: 1

Views

Author

R. H. Hardin, Nov 29 2015

Keywords

Comments

Column 3 of A264945.

Examples

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

Crossrefs

Cf. A264945.