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.

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

Original entry on oeis.org

17, 429, 10593, 260557, 6415089, 157933741, 3888200065, 95724317069, 2356654610641, 58018914711981, 1428378365629601, 35165510520296269, 865746191545503153, 21313965220121585837, 524732442187736997569
Offset: 1

Views

Author

R. H. Hardin Jan 17 2013

Keywords

Comments

Column 5 of A221446

Examples

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

Formula

Empirical: a(n) = 17*a(n-1) +168*a(n-2) +464*a(n-3) +442*a(n-4) +30*a(n-5) -88*a(n-6) -9*a(n-8) +a(n-9)