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.

A218586 Hilltop maps: number of n X n binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 n X n array.

Original entry on oeis.org

1, 13, 449, 56629, 28543403, 57707873919, 467122877883141, 15124271280844676313, 1958173356335852318774549, 1013875932726564267833657180687
Offset: 1

Views

Author

R. H. Hardin Nov 03 2012

Keywords

Comments

Diagonal of A218592

Examples

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