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.

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

Original entry on oeis.org

13, 169, 493, 1360, 4387, 14225, 49586, 175747, 645245, 2403872, 9120677, 34960907, 135357992, 527526895, 2067755087, 8138519992, 32142126101, 127268868773, 504981199930, 2006919956813, 7986355654043, 31813478437106, 126832238503405
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Column 5 of A207885

Examples

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

Formula

Empirical: a(n) = 10*a(n-1) -10*a(n-2) -192*a(n-3) +523*a(n-4) +1371*a(n-5) -5841*a(n-6) -3846*a(n-7) +32138*a(n-8) -2492*a(n-9) -101383*a(n-10) +45525*a(n-11) +191278*a(n-12) -128400*a(n-13) -213000*a(n-14) +178176*a(n-15) +129368*a(n-16) -132968*a(n-17) -32752*a(n-18) +50112*a(n-19) -1856*a(n-20) -7296*a(n-21) +1536*a(n-22) for n>23