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.

A231648 Number of nX5 0..2 arrays with no element less than a strict majority of its horizontal and vertical neighbors.

Original entry on oeis.org

51, 1189, 61574, 2412274, 96014413, 3936913977, 161357952814, 6602715583511, 270337779895196, 11069019817530645, 453147169968161944, 18550832129905355953, 759448690449540291323, 31091056859424132422442
Offset: 1

Views

Author

R. H. Hardin, Nov 12 2013

Keywords

Comments

Column 5 of A231651

Examples

			Some solutions for n=3
..0..2..1..0..0....0..0..2..2..2....0..0..0..0..0....0..0..0..0..2
..0..0..0..0..2....1..0..0..0..1....1..2..2..0..2....1..0..0..0..0
..1..0..0..0..0....0..0..2..0..0....1..2..2..0..0....2..2..1..0..0