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.

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

Original entry on oeis.org

17, 737, 20793, 629659, 19003811, 572765605, 17270172871, 520703946625, 15699497444771, 473348740584743, 14271727157207365, 430300515162577777, 12973799949967137925, 391167286570698841921, 11793911323529489973393
Offset: 1

Views

Author

R. H. Hardin Oct 28 2012

Keywords

Comments

Column 5 of A218426

Examples

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