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.

A183363 Number of n X n binary arrays with no element equal to the sum mod 3 of its horizontal and vertical neighbors.

Original entry on oeis.org

1, 3, 18, 138, 3102, 137688, 12617557, 2402945556, 936460285557, 739951660291721
Offset: 1

Views

Author

R. H. Hardin Jan 04 2011

Keywords

Comments

Diagonal of A183368

Examples

			Some solutions for 5X5
..1..0..0..1..1....1..1..1..0..0....1..1..1..1..0....1..1..0..0..1
..0..0..1..1..1....1..0..1..0..1....1..0..0..1..0....1..1..1..0..0
..1..0..1..0..1....1..1..1..0..0....1..0..0..1..1....1..0..1..1..1
..0..0..1..1..1....0..0..1..1..1....1..1..1..1..1....1..1..0..1..1
..1..0..1..1..1....1..0..1..1..1....1..1..0..0..0....0..1..1..1..0