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.

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

Original entry on oeis.org

1, 4, 56, 2592, 222850, 29357385, 5460708807, 1360701035812, 437196618018421, 175924945354032520
Offset: 1

Views

Author

R. H. Hardin, Dec 06 2015

Keywords

Comments

Column 3 of A265232.

Examples

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

Crossrefs

Cf. A265232.