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.

A183769 1/32 the number of (n+1) X 7 binary arrays with equal numbers of 2 X 2 subblocks with sum mod two being 0 and 1.

Original entry on oeis.org

160, 14784, 1555840, 173065984, 19855042560, 2323234636800, 275588031713280, 33021546171494400, 3987331943727333376, 484411726089672392704, 59141557731461248942080, 7250125459895693790478336
Offset: 1

Views

Author

R. H. Hardin, Jan 06 2011

Keywords

Comments

Column 6 of A183772.

Examples

			Some solutions for 3 X 7:
..0..0..0..1..0..0..1....0..0..0..0..0..1..0....0..0..0..0..1..1..0
..0..1..1..0..0..1..1....0..0..1..0..0..0..1....1..1..0..1..1..0..1
..0..0..0..1..1..1..1....1..0..1..1..0..0..1....1..1..0..0..0..1..1