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.

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

Original entry on oeis.org

3, 7, 47, 621, 14536, 764027, 113313853
Offset: 1

Views

Author

R. H. Hardin, Nov 30 2012

Keywords

Examples

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

Crossrefs

Diagonal of A219883.