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.

A183378 Number of nX5 binary arrays with no element equal to the mod 3 sum of its king-move neighbors.

Original entry on oeis.org

4, 37, 143, 627, 2767, 11345, 51706, 223151, 974387, 4317835, 18935262, 83405497, 367312087, 1616039971, 7119896616, 31348982360, 138041608632, 607987526596, 2677387312069, 11791160763537, 51928980096226, 228692213910063
Offset: 1

Views

Author

R. H. Hardin Jan 04 2011

Keywords

Comments

Column 5 of A183380

Examples

			Some solutions for 7X5
..0..1..1..0..1....0..1..0..1..0....1..0..0..1..0....0..1..1..0..0
..1..0..1..1..1....1..0..1..1..0....0..0..0..0..0....0..0..1..1..1
..1..1..1..1..0....0..1..1..0..0....0..1..0..0..0....0..1..1..1..1
..0..1..0..1..1....1..1..1..0..0....0..1..1..1..0....0..0..1..1..1
..1..0..1..1..0....0..1..1..0..1....0..0..0..0..1....0..1..1..0..0
..1..0..1..1..0....1..1..0..1..1....0..0..0..1..1....1..0..0..0..0
..0..1..0..1..1....1..0..1..0..1....1..0..0..0..0....1..1..0..1..0