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.

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

Original entry on oeis.org

1, 616, 9573, 230726, 4934366, 104434119, 2222033208, 47581843251, 1020963792078, 21891250379251, 469088799364095, 10050616587252213, 215366263056062190, 4615153893061065333, 98898611652123318575
Offset: 1

Views

Author

R. H. Hardin Nov 19 2012

Keywords

Comments

Row 6 of A219421

Examples

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