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.

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

Original entry on oeis.org

1, 2007, 137251, 6879341, 407374825, 24734141495, 1473655240387, 87658679181837, 5224891480887673, 311448275014507959, 18561000349587530731, 1106162872162349349293, 65924427026919551179361
Offset: 1

Views

Author

R. H. Hardin Nov 11 2012

Keywords

Comments

Row 6 of A219078

Examples

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