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.

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

Original entry on oeis.org

1, 7361, 1019123, 99118753, 11660290321, 1410242020653, 167024618548071, 19746897662050241, 2339794277074504521, 277259160805907947953, 32846897167510082525531, 3891392293661362699294561
Offset: 1

Views

Author

R. H. Hardin Nov 11 2012

Keywords

Comments

Row 7 of A219078

Examples

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