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.

A206995 Number of n X n 0..1 arrays avoiding 0 1 0 horizontally and 0 1 1 vertically.

Original entry on oeis.org

2, 16, 230, 6612, 382349, 45723467, 10432265840, 4567604720632, 3835202074248503, 6261201402096526687, 19792947737197868206612, 121328664454799987875557245, 1441630925698363945645049021360
Offset: 1

Views

Author

R. H. Hardin Feb 14 2012

Keywords

Comments

Diagonal of A207000

Examples

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