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.

A218351 Hilltop maps: number of nX5 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..1 nX5 array.

Original entry on oeis.org

17, 547, 14811, 401253, 10982565, 300126903, 8199377227, 224032447213, 6121258910011, 167250519310183, 4569773233045519, 124859601874166153, 3411530022687206815, 93212992000176142919, 2546851962811003392065
Offset: 1

Views

Author

R. H. Hardin Oct 26 2012

Keywords

Comments

Column 5 of A218354

Examples

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