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.

A219425 Unchanging value maps: number of 5 X n binary arrays indicating the locations of corresponding elements unequal to no horizontal or antidiagonal neighbor in a random 0..2 5 X n array.

Original entry on oeis.org

1, 200, 2043, 28888, 372560, 4775307, 61543422, 796901866, 10332516216, 133871792745, 1733790943515, 22454270113272, 290832016789657, 3766998295859184, 48791165925094356, 631950081288077455
Offset: 1

Views

Author

R. H. Hardin, Nov 19 2012

Keywords

Comments

Row 5 of A219421.

Examples

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

Crossrefs

Cf. A219421.