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.

A279491 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 two elements, and with new values introduced in order 0 sequentially upwards.

Original entry on oeis.org

3, 68, 1433, 26157, 425588, 6559816, 98128162, 1427793365, 20331614084, 284582186755, 3927098316740, 53546568580206, 722667680151302, 9667043295761140, 128315967227062823, 1691593872181009527
Offset: 1

Views

Author

R. H. Hardin, Dec 13 2016

Keywords

Comments

Column 5 of A279494.

Examples

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

Crossrefs

Cf. A279494.