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.

A183449 Number of nX8 binary arrays with every 1 having exactly two king-move neighbors equal to 1.

Original entry on oeis.org

1, 253, 1505, 7761, 176949, 1817225, 16192521, 216103851, 2491241396, 26807184942, 319246780548, 3727927654904, 42498891259325, 496063346878031, 5787799084661820, 67059980281582582, 780988033705277709
Offset: 1

Views

Author

R. H. Hardin Jan 04 2011

Keywords

Comments

Column 8 of A183450

Examples

			Some solutions for 5X8
..0..1..0..0..1..1..0..0....0..1..0..0..0..0..0..0....0..0..0..0..0..0..0..0
..1..1..0..0..1..0..0..1....0..1..1..0..0..1..1..0....0..0..1..0..0..0..1..1
..0..0..0..0..0..0..1..1....0..0..0..0..1..0..0..1....0..1..1..0..0..0..1..0
..1..0..0..0..0..0..0..0....1..1..0..0..0..1..1..0....0..0..0..0..1..0..0..0
..1..1..0..0..0..0..0..0....1..0..0..0..0..0..0..0....0..0..0..0..1..1..0..0