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.

A222321 Number of n X n 0..1 arrays with exactly floor(n X n/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..1 order.

Original entry on oeis.org

1, 0, 4, 52, 674, 38238, 2284728, 620488671, 174162198742, 206752746752932
Offset: 1

Views

Author

R. H. Hardin Feb 15 2013

Keywords

Comments

Diagonal of A222328

Examples

			Some solutions for n=4
..0..0..0..0....0..1..0..0....0..0..0..0....0..0..1..0....0..0..0..1
..1..0..0..0....1..0..0..0....0..0..0..0....1..1..1..1....0..0..0..1
..1..0..0..0....0..0..0..0....0..0..0..1....1..1..1..1....0..0..0..1
..0..0..0..0....0..0..0..0....0..0..1..1....1..1..1..1....0..0..0..1