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.

A279166 Number of nX6 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

9, 88, 2001, 34764, 557163, 8426362, 121098448, 1686053298, 22825771952, 302051174586, 3926950483003, 50292947670984, 635850396680521, 7951563133669828, 98499861578102570, 1210045057467722370
Offset: 1

Views

Author

R. H. Hardin, Dec 07 2016

Keywords

Comments

Column 6 of A279168.

Examples

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

Crossrefs

Cf. A279168.