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.

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

Original entry on oeis.org

40, 7392, 1555840, 346131968, 79420170240, 18585877094400, 4409408507412480, 1056689477487820800, 255189244398549336064, 62004700939478066266112, 15140238779254079729172480, 3712064235466595220724908032
Offset: 1

Views

Author

R. H. Hardin, Jan 06 2011

Keywords

Comments

Column 3 of A183772(2n).

Examples

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