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.

A207587 Number of nX6 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 1 vertically.

Original entry on oeis.org

26, 676, 756, 3150, 9698, 25776, 70800, 204476, 596068, 1584596, 4380740, 12246186, 33356536, 92744054, 250622912, 689213304, 1904187516, 5145503610, 14195771862, 38697328208, 105556471730, 290374890184, 787938050420, 2162268321240
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Column 6 of A207589

Examples

			Some solutions for n=4
..0..1..0..1..0..0....1..1..0..1..1..1....1..1..1..0..1..1....1..1..0..1..0..0
..1..0..1..0..1..1....0..1..1..0..1..0....0..1..0..1..0..0....1..0..1..0..1..0
..1..1..1..1..1..1....1..0..1..1..0..0....1..0..1..1..1..0....0..1..0..1..1..0
..0..1..0..1..0..0....1..1..0..1..1..0....1..0..1..0..1..0....0..1..1..1..0..0