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.

A218519 Number of nX5 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..3 nX5 array.

Original entry on oeis.org

94, 7902, 639228, 49466988, 3856183182, 300890728324, 23498366579584, 1835588124922808, 143401026618956100, 11203192491897097878, 875256805363669114070, 68380229008811109398218, 5342272688474066298382144
Offset: 1

Views

Author

R. H. Hardin Oct 31 2012

Keywords

Comments

Column 5 of A218522

Examples

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