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.

A208708 Number of nX7 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

64, 4516, 334948, 24754628, 1830045552, 135288700496, 10001404535216, 739367693888784, 54658781788350480, 4040726220144359312, 298716287704524626960, 22083015695332916533648, 1632517550173528777448208
Offset: 1

Views

Author

R. H. Hardin Mar 01 2012

Keywords

Comments

Column 7 of A208709

Examples

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

Formula

Empirical: a(n) = 83*a(n-1) -710*a(n-2) +3004*a(n-3) -7952*a(n-4) +16752*a(n-5) -27360*a(n-6) +33984*a(n-7) -26368*a(n-8) for n>10