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.

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

Original entry on oeis.org

2, 16, 102, 961, 21147, 811801, 44918280, 4186478209, 714320063886, 207770920176121, 99259943862610227, 80457895275392565121, 112399424925446158169479, 266845510437068945897046016
Offset: 1

Views

Author

R. H. Hardin Feb 22 2012

Keywords

Comments

Diagonal of A208039

Examples

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