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.

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

Original entry on oeis.org

2, 16, 72, 780, 10144, 181896, 5346600, 235865752, 13718515360, 1274547293612, 182632256870400, 35910248805192512, 10519355362828229320, 4986223632232028372840, 3295839087283933350008520
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Diagonal of A207845

Examples

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