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.

A265243 Number of 4Xn arrays containing n copies of 0..4-1 with no equal antidiagonal neighbors and new values introduced sequentially from 0.

Original entry on oeis.org

1, 68, 4716, 359172, 29189088, 2481226704, 217953360768, 19628937626304, 1802766369904128, 168204846247664640, 15899323155731638272, 1519290122351403276288, 146525430785641038692352
Offset: 1

Views

Author

R. H. Hardin, Dec 06 2015

Keywords

Comments

Row 4 of A265241.

Examples

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

Crossrefs

Cf. A265241.