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.

A280068 Number of nX7 0..1 arrays with no element unequal to a strict majority of its horizontal, vertical and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.

Original entry on oeis.org

8, 41, 281, 2157, 17468, 145485, 1188839, 9934415, 83159859, 698377561, 5887978374, 49721599049, 420447933252, 3558743911515, 30138816610398, 255354080222866, 2164080579680386, 18343719103540772, 155508281837894034
Offset: 1

Views

Author

R. H. Hardin, Dec 25 2016

Keywords

Comments

Column 7 of A280069.

Examples

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

Crossrefs

Cf. A280069.