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.

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

Original entry on oeis.org

1, 121, 553, 2399, 34867, 257733, 1744887, 16192521, 132651622, 1038281076, 8774615462, 72803921204, 594525068675, 4940133605905, 40989589283304, 338552166728150, 2806660250827517, 23275769947149983, 192804453727767520
Offset: 1

Views

Author

R. H. Hardin Jan 04 2011

Keywords

Comments

Column 7 of A183450

Examples

			Some solutions for 5X7
..0..1..1..0..0..0..0....0..0..0..0..1..0..0....0..1..1..0..1..0..0
..1..0..0..1..0..0..0....0..0..0..1..1..0..0....0..0..1..0..1..1..0
..1..0..1..0..0..0..0....0..0..0..0..0..0..0....1..0..0..0..0..0..0
..0..1..0..0..1..0..0....0..0..0..0..0..1..1....1..1..0..0..1..1..0
..0..0..0..1..1..0..0....0..0..0..0..0..1..0....0..0..0..0..0..1..0