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.

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

Original entry on oeis.org

2, 16, 102, 841, 13865, 314721, 6835345, 167806116, 7410251162, 472676875225, 25730176554865, 1604226387312025, 207661113723753822, 40075955918500009225, 5496265530262722657980, 835639569395431034391481
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Diagonal of A207908

Examples

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