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.

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

Original entry on oeis.org

2, 16, 102, 630, 4690, 34012, 287140, 2364992, 22028490, 200930125, 2026692954, 20118254688, 217071252489, 2316174126448, 26506083938686, 301219138880440, 3632894429145798, 43657425153387876, 552138493209771090
Offset: 1

Views

Author

R. H. Hardin Mar 11 2012

Keywords

Comments

Diagonal of A209650

Examples

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