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.

A207910 Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 0 1 1 vertically.

Original entry on oeis.org

13, 169, 611, 2209, 13865, 87025, 417425, 2002225, 10896915, 59305401, 303611925, 1554330625, 8194919925, 43206195321, 224558681991, 1167115069561, 6108464797743, 31970576988009, 166753685864931, 869761961442529
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Row 5 of A207908

Examples

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