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.

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

Original entry on oeis.org

12, 144, 612, 2100, 8778, 34668, 147084, 617732, 2671488, 11581700, 50920910, 224964992, 1001727900, 4480199928, 20136395180, 90815818836, 410932519010, 1864187195364, 8476190423340, 38611887901692, 176175077736008
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Column 5 of A207752

Examples

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

Formula

Empirical: a(n) = 12*a(n-1) -15*a(n-2) -318*a(n-3) +989*a(n-4) +3432*a(n-5) -15290*a(n-6) -19128*a(n-7) +121738*a(n-8) +55524*a(n-9) -583550*a(n-10) -56016*a(n-11) +1776187*a(n-12) -141444*a(n-13) -3467035*a(n-14) +588186*a(n-15) +4252641*a(n-16) -950232*a(n-17) -3104320*a(n-18) +827568*a(n-19) +1200096*a(n-20) -369792*a(n-21) -181440*a(n-22) +62208*a(n-23) for n>24