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.

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

Original entry on oeis.org

1, 11, 337, 32945, 14228041, 24734141495, 167024618548071, 4450580094888603089, 469651231165595918842913, 195869567064782965280559200707
Offset: 1

Views

Author

R. H. Hardin Nov 11 2012

Keywords

Comments

Diagonal of A219078

Examples

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