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.

A266160 Number of 5 X n arrays containing n copies of 0..5-1 with no element plus any horizontal, vertical or antidiagonal neighbor equal to 5-1.

Original entry on oeis.org

48, 1528, 85976, 7699384, 895747208, 121920870264, 17786755869336, 2703839577994464, 421768649710297424
Offset: 1

Views

Author

R. H. Hardin, Dec 22 2015

Keywords

Comments

Row 5 of A266158.

Examples

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

Crossrefs

Cf. A266158.