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.

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

Original entry on oeis.org

31, 2007, 105913, 5609569, 300126903, 16031828359, 856149291505, 45726317510017, 2442206384575879, 130435504723928475, 6966420606934069925, 372069142324752766777, 19871816932607721069123, 1061332595121563636599299
Offset: 1

Views

Author

R. H. Hardin Oct 26 2012

Keywords

Comments

Column 6 of A218354

Examples

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