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.

A206984 Number of nX5 0..1 arrays avoiding the patterns 0 1 0 or 1 0 1 in any row, column, diagonal or antidiagonal.

Original entry on oeis.org

16, 256, 420, 1866, 7500, 27762, 106110, 413526, 1583234, 6065840, 23380612, 89904320, 345225042, 1327292244, 5103379268, 19613888918, 75392090306, 289821707064, 1114041030214, 4282214237068, 16460713051026, 63274053473750
Offset: 1

Views

Author

R. H. Hardin Feb 14 2012

Keywords

Comments

Column 5 of A206987

Examples

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

Formula

Empirical: a(n) = 5*a(n-1) -7*a(n-2) +17*a(n-3) -27*a(n-4) +2*a(n-5) +47*a(n-6) -201*a(n-7) -179*a(n-8) +23*a(n-9) +255*a(n-10) -331*a(n-11) -206*a(n-12) +691*a(n-13) +704*a(n-14) -353*a(n-15) -775*a(n-16) +88*a(n-17) -15*a(n-18) +86*a(n-19) -192*a(n-20) +15*a(n-21) +64*a(n-22) +40*a(n-23) +8*a(n-24) -10*a(n-25) for n>27