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.

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

Original entry on oeis.org

8, 8, 8, 16, 312, 14936, 310552, 8027264, 153019144, 3430340488, 64644807000, 1348807023952, 25490020592680, 512739267856872, 9742558843713512, 192399460839867616, 3675912909241399304, 71947890449406450248
Offset: 1

Views

Author

R. H. Hardin, Dec 23 2015

Keywords

Comments

Row 4 of A266208.

Examples

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

Crossrefs

Cf. A266208.