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.

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

Original entry on oeis.org

2, 16, 102, 989, 15839, 454223, 22743106, 1965912435, 292568573966, 74527048580258, 32449227184884623, 24089588153258657647, 30462508808101945246072, 65556106479277551484530086
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Diagonal of A207960

Examples

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