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.

A183375 Number of n X n binary arrays with no element equal to the mod 3 sum of its king-move neighbors.

Original entry on oeis.org

1, 5, 28, 225, 2767, 64530, 2952294, 238729120, 34520238211
Offset: 1

Views

Author

R. H. Hardin Jan 04 2011

Keywords

Comments

Diagonal of A183380

Examples

			Some solutions for 5X5
..1..1..0..0..1....0..0..0..1..0....1..1..0..1..1....1..0..0..0..0
..0..1..0..0..0....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....0..0..1..1..0....1..0..0..0..0
..1..1..0..0..0....0..1..1..1..1....0..0..1..1..1....0..0..0..0..0
..0..0..0..1..0....0..1..0..0..1....0..1..1..0..1....0..1..0..0..1