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.

A207849 Number of 6Xn 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 1 1 vertically.

Original entry on oeis.org

26, 676, 2080, 9672, 41444, 181896, 794768, 3479268, 15223104, 66632488, 291591092, 1276262520, 5585326656, 24445752916, 106984774208, 468241205640, 2049246237012, 8968858409576, 39252328435216, 171793006303620
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Row 6 of A207845

Examples

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

Formula

Empirical: a(n) = 3*a(n-1) +17*a(n-2) -45*a(n-3) -47*a(n-4) +155*a(n-5) -155*a(n-7) +47*a(n-8) +45*a(n-9) -17*a(n-10) -3*a(n-11) +a(n-12) for n>13