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.

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

Original entry on oeis.org

2, 16, 98, 791, 6766, 65094, 786907, 9855231, 142116676, 2459545057, 46309750425, 999589825419, 26202502382134, 768926273969151, 25878896800392858, 1098191860946291476, 52205734467966457603, 2867736141204451650414
Offset: 1

Views

Author

R. H. Hardin Feb 20 2012

Keywords

Comments

Diagonal of A207785

Examples

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