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.

A279167 Number of nX7 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

15, 284, 7709, 203226, 5159514, 121098448, 2708250146, 58954576326, 1248383818884, 25842455526113, 526028318802380, 10553193022979559, 209056148689381340, 4097404879908777416, 79569078719501719249
Offset: 1

Views

Author

R. H. Hardin, Dec 07 2016

Keywords

Comments

Column 7 of A279168.

Examples

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

Crossrefs

Cf. A279168.