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.

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

15, 162, 2903, 60304, 1331471, 26724386, 517476726, 10025433990, 191191601644, 3592564336954, 66997045991457, 1240581415395934, 22812879393607545, 417195888212408920, 7594010221332762302, 137646990170206088748
Offset: 1

Views

Author

R. H. Hardin, Dec 06 2016

Keywords

Comments

Column 7 of A279158.

Examples

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

Crossrefs

Cf. A279158.