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.

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

Original entry on oeis.org

1, 1201, 65569, 2897357, 157933741, 8569227073, 456064257841, 24333809830873, 1300168164767193, 69442977248777937, 3708745793506329473, 198080464024573391557, 10579291552464655635125, 565028486364173641870457
Offset: 1

Views

Author

R. H. Hardin Jan 17 2013

Keywords

Comments

Row 6 of A221446

Examples

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