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.

A208703 Number of n X n 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors.

Original entry on oeis.org

1, 8, 196, 16084, 4226368, 3613193828, 10001404535216, 89755737081698964, 2610569024927748701352, 246105734855228896970291844, 75198808251676193628977268566832, 74474161314983311603786393034039933768
Offset: 1

Views

Author

R. H. Hardin Mar 01 2012

Keywords

Comments

Diagonal of A208709

Examples

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