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.

A207738 Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.

Original entry on oeis.org

15, 225, 1425, 10535, 86355, 733363, 6349893, 55343835, 484078805, 4239251331, 37149155225, 325617022405, 2854427890525, 25023592056775, 219376652808375, 1923245408892489, 16860907224450661, 147818180556775365
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Column 5 of A207741

Examples

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

Formula

Empirical: a(n) = 12*a(n-1) -2*a(n-2) -307*a(n-3) +431*a(n-4) +2588*a(n-5) -3497*a(n-6) -10961*a(n-7) +10555*a(n-8) +24977*a(n-9) -14239*a(n-10) -30241*a(n-11) +8813*a(n-12) +19175*a(n-13) -2139*a(n-14) -6107*a(n-15) +82*a(n-16) +903*a(n-17) +13*a(n-18) -56*a(n-19) +a(n-21) for n>22