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.

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

Original entry on oeis.org

1, 9, 221, 18393, 6415089, 8569227073, 43045366565233, 827667742380908273, 60943705772313538144913, 17137605013408451421126281145, 18409652574456111249919293718583541
Offset: 1

Views

Author

R. H. Hardin Jan 17 2013

Keywords

Comments

Diagonal of A221446

Examples

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