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.

A279463 Number of nX5 0..1 arrays with no element equal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.

Original entry on oeis.org

5, 66, 1024, 15484, 223261, 3086910, 41706415, 555052466, 7290902341, 94741575142, 1220402478079, 15606462944668, 198344727196650, 2507419882264676, 31552047403315039, 395430103470867594
Offset: 1

Views

Author

R. H. Hardin, Dec 12 2016

Keywords

Comments

Column 5 of A279466.

Examples

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

Crossrefs

Cf. A279466.