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.

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

Original entry on oeis.org

35, 1225, 4861, 16742, 106503, 486443, 3569728, 18874239, 139219755, 803098636, 5786553545, 35249727777, 248244598082, 1565658732841, 10842687856821, 69941258792526, 479065006181663, 3136670786824267, 21341996465201648
Offset: 1

Views

Author

R. H. Hardin Feb 22 2012

Keywords

Comments

Column 7 of A208007

Examples

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

Formula

Empirical: a(n) = 13*a(n-1) -6*a(n-2) -485*a(n-3) +1437*a(n-4) +3392*a(n-5) -14770*a(n-6) -2894*a(n-7) +44308*a(n-8) -15290*a(n-9) -46782*a(n-10) +23648*a(n-11) +18387*a(n-12) -9503*a(n-13) -2702*a(n-14) +1151*a(n-15) +129*a(n-16) -32*a(n-17) for n>18