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.

A218891 Number of n X n arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 n X n array.

Original entry on oeis.org

2, 6, 72, 1096, 54726, 4575512, 969423130, 418239229652, 408299236290280, 866521302130938818
Offset: 1

Views

Author

R. H. Hardin Nov 08 2012

Keywords

Comments

Diagonal of A218897

Examples

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