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.

A280232 Number of nX7 0..1 arrays with no element unequal 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

15, 42, 95, 678, 3376, 16282, 80825, 377706, 1780344, 8321484, 38431266, 177322266, 812861536, 3712259660, 16906747879, 76738963064, 347459922194, 1569637145558, 7075367986446, 31833804360316, 142976818494750, 641124031114626
Offset: 1

Views

Author

R. H. Hardin, Dec 29 2016

Keywords

Comments

Column 7 of A280233.

Examples

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

Crossrefs

Cf. A280233.