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.

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

Original entry on oeis.org

2, 16, 230, 6478, 472412, 87541530, 37121455086, 35861331864570, 81188767942820548, 433324879893854403222, 5417399373066905672590966, 158241198424834434935170407538, 10811858970416460513671922192330804
Offset: 1

Views

Author

R. H. Hardin Feb 13 2012

Keywords

Comments

Diagonal of A206883

Examples

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