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.

A219683 Number of nX5 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nX5 array.

Original entry on oeis.org

15, 22, 208, 1531, 8964, 44816, 220182, 1116208, 5697556, 28354294, 135630422, 623221049, 2761665622, 11842133497, 49237357701, 198775751684, 780253085746, 2982381614057, 11117260746432, 40470971856226, 144060818799022
Offset: 1

Views

Author

R. H. Hardin Nov 25 2012

Keywords

Comments

Column 5 of A219686

Examples

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