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.

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

Original entry on oeis.org

2, 16, 102, 729, 8151, 105625, 1369900, 19891600, 334808748, 6181890625, 122401625127, 2624869821025, 60940432893132, 1515981414587236, 40169735443014974, 1131549414709903225, 33790458968920700067
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Diagonal of A207703

Examples

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