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.

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

Original entry on oeis.org

2016, 5912192, 19855042560, 70577422755840, 258888921984516096, 968823452179344785408, 3676119951496408119115776, 14091184863095839321177456640, 54435471052008802940182132162560
Offset: 1

Views

Author

R. H. Hardin, Jan 06 2011

Keywords

Comments

Column 5 of A183772(2n).

Examples

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