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.

A281808 Number of 7 X n 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal 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

0, 400, 5191, 117401, 1770697, 28237876, 436154254, 6282549989, 91589152155, 1288443030127, 17891751065943, 246129086382234, 3333215777163938, 44817385604532614, 597117631739752174, 7892791183495285965
Offset: 1

Views

Author

R. H. Hardin, Jan 30 2017

Keywords

Comments

Row 7 of A281802.

Examples

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

Crossrefs

Cf. A281802.