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.

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

Original entry on oeis.org

1, 405, 5949, 73136, 989947, 12867295, 170792866, 2268088205, 30263321279, 403675695558, 5385766437559, 71840547896222, 958386976026868, 12786233698435986, 170595408884312447, 2276122067209739706
Offset: 1

Views

Author

R. H. Hardin Nov 12 2012

Keywords

Comments

Row 6 of A219142

Examples

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