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.

A208010 Number of nX5 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 0 1 1 vertically.

Original entry on oeis.org

13, 169, 624, 2304, 5952, 15376, 32860, 70225, 132765, 251001, 434868, 753424, 1222144, 1982464, 3053952, 4704561, 6951645, 10272025, 14666080, 20939776, 29048448, 40297104, 54548364, 73839649, 97865677, 129709321, 168784980
Offset: 1

Views

Author

R. H. Hardin Feb 22 2012

Keywords

Comments

Column 5 of A208013

Examples

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

Formula

Empirical: a(n) = 2*a(n-1) +6*a(n-2) -14*a(n-3) -14*a(n-4) +42*a(n-5) +14*a(n-6) -70*a(n-7) +70*a(n-9) -14*a(n-10) -42*a(n-11) +14*a(n-12) +14*a(n-13) -6*a(n-14) -2*a(n-15) +a(n-16)