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.

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

Original entry on oeis.org

19, 361, 1995, 17119, 123709, 955073, 7184755, 54606513, 413322903, 3133722193, 23742848381, 179940784609, 1363558911785, 10333337050839, 78306467535059, 593415477442647, 4496952127639277, 34078343213807171, 258248804284088975
Offset: 1

Views

Author

R. H. Hardin Feb 22 2012

Keywords

Comments

Row 6 of A208028

Examples

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

Formula

Empirical: a(n) = 5*a(n-1) +30*a(n-2) -64*a(n-3) -157*a(n-4) +303*a(n-5) +101*a(n-6) -262*a(n-7) -23*a(n-8) +64*a(n-9) -4*a(n-11)