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.

A208112 Number of 7Xn 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 1 0 vertically.

Original entry on oeis.org

35, 1225, 2485, 5041, 89815, 1600225, 4747545, 14085009, 176312187, 2207026441, 8330645133, 31444864929, 316504755855, 3185743068225, 14132905548945, 62697780385249, 546849942762131, 4769624348126089, 23640747042219941
Offset: 1

Views

Author

R. H. Hardin Feb 23 2012

Keywords

Comments

Row 7 of A208108

Examples

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

Formula

Empirical: a(n) = 2*a(n-1) +34*a(n-3) +1153*a(n-4) -1184*a(n-5) -1088*a(n-6) -33792*a(n-8) +32768*a(n-9)