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.

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

Original entry on oeis.org

2, 3, 11, 35, 107, 325, 995, 3083, 9663, 30581, 97541
Offset: 1

Views

Author

R. H. Hardin Nov 20 2012

Keywords

Comments

Diagonal of A219502

Examples

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