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.

A219125 Number of nX5 arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..2 nX5 array.

Original entry on oeis.org

37, 899, 27993, 717585, 20168447, 558561433, 15524812691, 432020067871, 12027081633341, 334920902829343, 9328024055916403, 259818417215925211, 7237161898806635431, 201593314430614908129, 5615507084462551417685
Offset: 1

Views

Author

R. H. Hardin Nov 12 2012

Keywords

Comments

Column 5 of A219128

Examples

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