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.

A266159 Number of 4Xn arrays containing n copies of 0..4-1 with no element plus any horizontal, vertical or antidiagonal neighbor equal to 4-1.

Original entry on oeis.org

8, 16, 40, 272, 5512, 149232, 3741272, 88206664, 2011246768, 44947984536, 994530883200, 21910419274224, 482270052357104, 10627338833274072, 234722322559349072, 5199318920693106784, 115536868266599859880
Offset: 1

Views

Author

R. H. Hardin, Dec 22 2015

Keywords

Comments

Row 4 of A266158.

Examples

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

Crossrefs

Cf. A266158.