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.

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

Original entry on oeis.org

2, 16, 241, 10621, 1128580, 289951889, 189659424011, 309962689144609, 1271408331944150733, 13184774275002026128508, 345132526969505296701072063, 22839657048171631176301571722877, 3824685810041409132386645720304598864
Offset: 1

Views

Author

R. H. Hardin Feb 15 2012

Keywords

Comments

Diagonal of A207088

Examples

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