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.

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

Original entry on oeis.org

6, 205920, 2323234636800, 7506428481300850827264, 6612015156138094974390271820169216
Offset: 1

Views

Author

R. H. Hardin, Jan 06 2011

Keywords

Comments

Diagonal A183772(2n,2n).

Examples

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