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.

A219414 Unmatched value maps: number of 5Xn binary arrays indicating the locations of corresponding elements not equal to any horizontal or antidiagonal neighbor in a random 0..2 5Xn array.

Original entry on oeis.org

1, 200, 7687, 181089, 4560446, 121641579, 3227238239, 85112947762, 2245268308652, 59261110503227, 1564126144398995, 41281591776574486, 1089532969597092827, 28755799092752402466, 758945504939672363597
Offset: 1

Views

Author

R. H. Hardin Nov 19 2012

Keywords

Comments

Row 5 of A219410

Examples

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