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.

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

Original entry on oeis.org

2, 16, 60, 324, 1794, 12654, 111328, 1037300, 13597800, 200667632, 3402101520, 81763293780, 1957289927740, 66305181080964, 2590637896086730, 114679284980561840, 7286860676676341916, 454949245195033857996
Offset: 1

Views

Author

R. H. Hardin Feb 27 2012

Keywords

Comments

Diagonal of A208501

Examples

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