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.

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

Original entry on oeis.org

2, 16, 108, 1360, 41092, 2405923, 284247216, 68394049216, 33064776069834, 31868588102983450, 61446275576502856313, 236673591523285699197386, 1818567731722871472685169098, 27879399799936252965503867197417
Offset: 1

Views

Author

R. H. Hardin Feb 17 2012

Keywords

Comments

Diagonal of A207442

Examples

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