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.

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

Original entry on oeis.org

2, 16, 98, 643, 5594, 58602, 737575, 10609482, 171524786, 3063622641, 59875563176, 1270299719270, 29076260441101, 714274071132328, 18746674985446278, 523589036696879095, 15507197067809135806, 485494086155807224584
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Diagonal of A207938

Examples

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