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.

Previous Showing 11-11 of 11 results.

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

Original entry on oeis.org

2, 16, 98, 643, 4047, 22714, 139341, 794118, 4654884, 27655332, 162017453, 985389943, 5963777274, 36963453329, 232521285314, 1479703961900, 9627524117464
Offset: 1

Views

Author

R. H. Hardin Feb 15 2012

Keywords

Comments

Diagonal of A207111

Examples

			Some solutions for n=4
..1..1..1..1....0..0..1..0....1..0..0..1....1..1..0..1....1..1..1..0
..1..1..0..0....1..0..1..0....0..1..0..0....0..0..1..0....0..1..0..0
..1..1..1..1....0..0..1..0....1..1..0..1....0..1..0..1....0..1..0..0
..1..1..0..0....0..0..1..0....0..1..0..0....0..0..1..0....0..1..0..0
Previous Showing 11-11 of 11 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.