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.

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

Original entry on oeis.org

2240, 823680, 346131968, 153876579840, 70577422755840, 33021546171494400, 15664518350357381120, 7506428481300850827264, 3625062729947846895239168, 1761398107886979915147182080, 860111024347049203759900262400
Offset: 1

Views

Author

R. H. Hardin, Jan 06 2011

Keywords

Comments

Column 8 of A183772.

Examples

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