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.

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

Original entry on oeis.org

2, 16, 102, 1377, 26845, 955073, 56728924, 5753550295, 985606824420, 287995609933240, 142779868614005475, 120212913507245137971, 171965976593899860842629, 417924073201539457547295084
Offset: 1

Views

Author

R. H. Hardin Feb 22 2012

Keywords

Comments

Diagonal of A208028

Examples

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