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.

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

8, 72, 874, 11932, 166552, 2145788, 26724386, 330704288, 4027185426, 48341053840, 575447444416, 6798252425856, 79744778501470, 930090029926488, 10795234169830306, 124750828432766768, 1436120215880230752
Offset: 1

Views

Author

R. H. Hardin, Dec 06 2016

Keywords

Comments

Column 6 of A279158.

Examples

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

Crossrefs

Cf. A279158.