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.

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

Original entry on oeis.org

1, 4063, 437437, 36364977, 3888200065, 414116287743, 43045366565233, 4487793927664209, 468786655087266657, 48944887790539796639, 5109638176609475597301, 533452901877309087321537
Offset: 1

Views

Author

R. H. Hardin Jan 17 2013

Keywords

Comments

Row 7 of A221446

Examples

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