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.

A279165 Number of nX5 0..1 arrays with no element equal to a strict majority of its king-move neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.

Original entry on oeis.org

3, 24, 483, 5628, 57248, 557163, 5159514, 45915548, 396958758, 3354431037, 27818139968, 227109345763, 1829793702631, 14577379224104, 115006531796224, 899624259907987, 6984552550608837, 53866857503363854, 412968368588533755
Offset: 1

Views

Author

R. H. Hardin, Dec 07 2016

Keywords

Comments

Column 5 of A279168.

Examples

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

Crossrefs

Cf. A279168.