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.

A279155 Number of n X 5 0..1 arrays with no element equal to a strict majority of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.

Original entry on oeis.org

5, 30, 255, 2294, 20104, 166552, 1331471, 10508084, 81594334, 624717186, 4739157622, 35661603332, 266406928267, 1978392492492, 14617489508922, 107516403089962, 787701900591720, 5750928990829306, 41856485102494388
Offset: 1

Views

Author

R. H. Hardin, Dec 06 2016

Keywords

Comments

Column 5 of A279158.

Examples

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

Crossrefs

Cf. A279158.