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.

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

Original entry on oeis.org

2, 16, 108, 900, 6300, 50176, 352800, 2722500, 19111950, 144288144, 1010017008, 7505103424, 52382558592, 384598425600, 2677165603200, 19473033306276, 135229397960250, 976281270250000, 6765629202832500, 48545357372612100
Offset: 1

Views

Author

R. H. Hardin Feb 23 2012

Keywords

Comments

Diagonal of A208142

Examples

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