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.

A219424 Unchanging value maps: number of 4Xn binary arrays indicating the locations of corresponding elements unequal to no horizontal or antidiagonal neighbor in a random 0..2 4Xn array.

Original entry on oeis.org

1, 65, 436, 3617, 28154, 218838, 1709703, 13384389, 104853209, 820979848, 6427053212, 50316786006, 393951173336, 3084409493138, 24148717621856, 189066773722441, 1480260894360447, 11589420628440440
Offset: 1

Views

Author

R. H. Hardin Nov 19 2012

Keywords

Comments

Row 4 of A219421

Examples

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