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.

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

Original entry on oeis.org

1, 355, 9829, 230845, 6415089, 177320895, 4832005625, 131942833529, 3606055280657, 98529266203659, 2692051448713949, 73554857285973785, 2009736562063323785, 54911874439751493035, 1500353181134236949205
Offset: 1

Views

Author

R. H. Hardin Jan 17 2013

Keywords

Comments

Row 5 of A221446

Examples

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