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.

A231744 Number of n X 5 0..3 arrays with no element less than a strict majority of its horizontal and vertical neighbors.

Original entry on oeis.org

144, 6064, 784076, 71742015, 6425495277, 598711367728, 56006640316980, 5220406326242670, 486885544941495652, 45439583623043602188, 4239994977410757148897, 395581225544558104634606, 36907440894481310915676768, 3443519378497211484011972191, 321285969990496676187195798327
Offset: 1

Views

Author

R. H. Hardin, Nov 13 2013

Keywords

Examples

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

Crossrefs

Column 5 of A231746.