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.

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

Original entry on oeis.org

2, 16, 60, 432, 3094, 25776, 263550, 3832616, 69396520, 1475600124, 38962584092, 1441585611138, 67002761499928, 3878723937334928, 264400592646069420, 24784751879627310504, 3083505379073129163384, 470186218198870776234068
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Diagonal of A207589

Examples

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