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.

A206983 Number of nX4 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

10, 100, 158, 556, 1866, 5804, 18528, 59888, 191484, 612874, 1966402, 6301118, 20187672, 64705162, 207369486, 664535672, 2129687696, 6825166670, 21872797724, 70096742330, 224642588748, 719921959060, 2307166259316, 7393882758084
Offset: 1

Views

Author

R. H. Hardin Feb 14 2012

Keywords

Comments

Column 4 of A206987

Examples

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

Formula

Empirical: a(n) = 4*a(n-1) -4*a(n-2) +10*a(n-3) -18*a(n-4) +8*a(n-5) -16*a(n-6) -4*a(n-7) -3*a(n-8) +21*a(n-9) +13*a(n-10) -12*a(n-11) for n>13