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.

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

Original entry on oeis.org

2, 16, 126, 2601, 139605, 17098225, 4412968520, 2580469555456, 3485691022698248, 10640054910525548209, 72722981173167013234455, 1123008691175260414001447481, 39309117808240836879763740048294
Offset: 1

Views

Author

R. H. Hardin Feb 23 2012

Keywords

Comments

Diagonal of A208078

Examples

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