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.

A202095 Number of (n+2)X5 binary arrays avoiding patterns 001 and 011 in rows and columns.

Original entry on oeis.org

720, 3600, 12000, 40000, 105000, 275625, 617400, 1382976, 2765952, 5531904, 10160640, 18662400, 32076000, 55130625, 89842500, 146410000, 228399600, 356303376, 535927392, 806105664, 1175570760, 1714374025, 2434614000
Offset: 1

Views

Author

R. H. Hardin Dec 11 2011

Keywords

Comments

Column 3 of A202100

Examples

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

Formula

Empirical: a(n) = 2*a(n-1) +8*a(n-2) -18*a(n-3) -27*a(n-4) +72*a(n-5) +48*a(n-6) -168*a(n-7) -42*a(n-8) +252*a(n-9) -252*a(n-11) +42*a(n-12) +168*a(n-13) -48*a(n-14) -72*a(n-15) +27*a(n-16) +18*a(n-17) -8*a(n-18) -2*a(n-19) +a(n-20)