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.

A265861 Number of nX3 arrays containing 3 copies of 0..n-1 with no element plus any vertical neighbor equal to n-1.

Original entry on oeis.org

1, 0, 152, 22016, 11544576, 7521762432, 11355242996304, 19696965348836352
Offset: 1

Views

Author

R. H. Hardin, Dec 17 2015

Keywords

Comments

Column 3 of A265863.

Examples

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

Crossrefs

Cf. A265863.