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.

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

Original entry on oeis.org

2, 16, 102, 1269, 18395, 365094, 8948825, 295643872, 11569038318, 627185978622, 39743547264799, 3541122637275087, 367535911624122068, 55280614681310159979, 9428817551220326025746, 2476044134980962346444356
Offset: 1

Views

Author

R. H. Hardin Feb 26 2012

Keywords

Comments

Diagonal of A208420

Examples

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