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.

A206878 Number of nX3 0..1 arrays avoiding 0 1 0 horizontally and 1 0 1 vertically.

Original entry on oeis.org

7, 49, 230, 1011, 4705, 22412, 105936, 497727, 2339729, 11013295, 51846666, 244013222, 1148355280, 5404522372, 25435928407, 119711433603, 563405871570, 2651594982047, 12479394172896, 58732688555813, 276417903263710
Offset: 1

Views

Author

R. H. Hardin Feb 13 2012

Keywords

Comments

Column 3 of A206883

Examples

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

Formula

Empirical: a(n) = 5*a(n-1) -7*a(n-2) +24*a(n-3) +8*a(n-4) +11*a(n-5) +32*a(n-6) -22*a(n-7) -44*a(n-8) +11*a(n-9) +13*a(n-10) -a(n-11) -a(n-12)