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.

A209652 Number of 5Xn 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 0 1 and 1 0 1 vertically.

Original entry on oeis.org

10, 100, 390, 1215, 4690, 16830, 65765, 251160, 994050, 3911375, 15639390, 62524602, 251961125, 1016913820, 4122470862, 16742504735, 68184829338, 278147046150, 1136817652005, 4652769761136, 19069624615146, 78246585726191
Offset: 1

Views

Author

R. H. Hardin Mar 11 2012

Keywords

Comments

Row 5 of A209650

Examples

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

Formula

Empirical: a(n) = 11*a(n-1) -13*a(n-2) -243*a(n-3) +709*a(n-4) +2169*a(n-5) -9198*a(n-6) -9930*a(n-7) +61958*a(n-8) +23330*a(n-9) -254062*a(n-10) -16614*a(n-11) +669763*a(n-12) -53961*a(n-13) -1146177*a(n-14) +176529*a(n-15) +1247849*a(n-16) -252499*a(n-17) -820948*a(n-18) +202824*a(n-19) +291592*a(n-20) -85440*a(n-21) -41472*a(n-22) +13824*a(n-23) for n>24