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.

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

Original entry on oeis.org

13, 169, 499, 1322, 4041, 12151, 39050, 126411, 423951, 1437618, 4974835, 17381451, 61478628, 219050691, 786599271, 2839798658, 10305461639, 37542605947, 137251905940, 503176001107, 1849256209667, 6809974286746, 25122207285003
Offset: 1

Views

Author

R. H. Hardin Feb 18 2012

Keywords

Comments

Column 5 of A207488

Examples

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

Formula

Empirical: a(n) = 10*a(n-1) +3*a(n-2) -319*a(n-3) +570*a(n-4) +4375*a(n-5) -12102*a(n-6) -33910*a(n-7) +122896*a(n-8) +163430*a(n-9) -765272*a(n-10) -501760*a(n-11) +3186635*a(n-12) +928246*a(n-13) -9216729*a(n-14) -691675*a(n-15) +18785794*a(n-16) -1206433*a(n-17) -26966924*a(n-18) +4392278*a(n-19) +26904794*a(n-20) -6452612*a(n-21) -18149412*a(n-22) +5510570*a(n-23) +7897352*a(n-24) -2815136*a(n-25) -2054612*a(n-26) +816504*a(n-27) +282560*a(n-28) -120480*a(n-29) -15552*a(n-30) +6912*a(n-31) for n>32