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.

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

Original entry on oeis.org

109824, 5134924800, 275588031713280, 15664518350357381120, 919029987874102029778944, 55014538812191247245224181760, 3339401594009138875954682737459200
Offset: 1

Views

Author

R. H. Hardin, Jan 06 2011

Keywords

Comments

Column 7 of A183772(2n).

Examples

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