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.

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

Original entry on oeis.org

2, 16, 90, 558, 3315, 16038, 95900, 492932, 2542374, 14009768, 70576726, 371721351, 1947251540, 9924535935, 51877222492, 266862076008, 1370454630930, 7087023247175, 36312119188998, 186625648529320, 958786992765737
Offset: 1

Views

Author

R. H. Hardin Feb 14 2012

Keywords

Comments

Diagonal of A207024

Examples

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