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.

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

Original entry on oeis.org

2, 16, 90, 625, 7315, 130321, 1432600, 17850625, 339961440, 8208541201, 137250396283, 2528484794641, 64191779662920, 1915940360359936, 43397063924977512, 1065586805357114881, 33367357471586657167
Offset: 1

Views

Author

R. H. Hardin Feb 23 2012

Keywords

Comments

Diagonal of A208118

Examples

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