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.

A208839 Number of nX7 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 1 and 1 1 0 vertically.

Original entry on oeis.org

42, 1764, 7086, 31419, 169974, 992574, 6206445, 40122936, 265568130, 1780946115, 12045557394, 81883111842, 558396389421, 3815311552572, 26099962612902, 178677791790795, 1223770846004094, 8384018150245206, 57448693695345549
Offset: 1

Views

Author

R. H. Hardin Mar 01 2012

Keywords

Comments

Column 7 of A208840

Examples

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

Formula

Empirical: a(n) = 11*a(n-1) -17*a(n-2) -124*a(n-3) +276*a(n-4) +396*a(n-5) -902*a(n-6) -462*a(n-7) +946*a(n-8) +220*a(n-9) -340*a(n-10) -44*a(n-11) +39*a(n-12) +3*a(n-13) -a(n-14) for n>15