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.

A207763 Number of 3Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 0 1 vertically.

Original entry on oeis.org

6, 36, 82, 221, 493, 1095, 2654, 6203, 14182, 33242, 77781, 180207, 419683, 979186, 2277663, 5301348, 12351370, 28755901, 66942929, 155895195, 362997882, 845159395, 1967953186, 4582333234, 10669471213, 24843252803, 57846384111
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Row 3 of A207762

Examples

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

Formula

Empirical: a(n) = a(n-1) +8*a(n-3) +a(n-5) -12*a(n-6) -3*a(n-7) +a(n-8) +10*a(n-9) -2*a(n-10) -3*a(n-12) for n>14