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.

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

Original entry on oeis.org

2, 16, 102, 1004, 14253, 237576, 5715255, 163471950, 6200122170, 294261603282, 17977383927693, 1375335087129521, 138833395825965196, 17233401412131428885, 2924391663494366576782, 600552802391087361313757
Offset: 1

Views

Author

R. H. Hardin Feb 18 2012

Keywords

Comments

Diagonal of A207500

Examples

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