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.

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

Original entry on oeis.org

2, 16, 84, 870, 13902, 264568, 12327618, 1144562438, 64916691796, 20511370392174, 15431327748576322, 2046762983891357336, 5203964479172695849850, 32433326970178563780859912
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Diagonal of A207661

Examples

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