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.

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

Original entry on oeis.org

2, 16, 78, 361, 6235, 261121, 4747545, 90782784, 18473477832, 9693564675601, 668167531935849, 46925086118316121, 128627682135940435023, 919037094400530117376144, 213624920267877921384329046
Offset: 1

Views

Author

R. H. Hardin Feb 23 2012

Keywords

Comments

Diagonal of A208108

Examples

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