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.

A186126 Number of (n+1)X8 binary arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum.

Original entry on oeis.org

298, 5214, 34678, 350266, 2915982, 29491822, 264173146, 2630528360, 24515504568, 241032804442, 2294311413454, 22390251063942, 215298723003602, 2093763781095758, 20224956581082238, 196384193909326548
Offset: 1

Views

Author

R. H. Hardin Feb 13 2011

Keywords

Comments

Column 7 of A186128

Examples

			Some solutions for 3X8
..0..0..1..1..0..1..1..0....1..0..0..0..1..1..0..0....1..0..1..0..1..1..0..0
..0..0..0..1..1..1..1..1....1..0..0..0..0..1..1..1....0..0..0..0..1..1..1..1
..1..1..0..1..1..0..0..1....0..0..1..1..0..0..0..0....0..1..0..1..1..0..1..1