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.

A206932 Number of nX4 0..1 arrays avoiding 0 0 0 horizontally and 0 1 1 vertically.

Original entry on oeis.org

13, 169, 1153, 6837, 35277, 170409, 783557, 3498981, 15313557, 66183221, 283695069, 1209894989, 5143701217, 21827038973, 92522770909, 391969130401, 1660088519969, 7030078814173, 29769974336161, 126068348345329
Offset: 1

Views

Author

R. H. Hardin Feb 13 2012

Keywords

Comments

Column 4 of A206936

Examples

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

Formula

Empirical: a(n) = 10*a(n-1) -24*a(n-2) -50*a(n-3) +241*a(n-4) -8*a(n-5) -750*a(n-6) +328*a(n-7) +1008*a(n-8) -448*a(n-9) -642*a(n-10) +200*a(n-11) +191*a(n-12) -34*a(n-13) -24*a(n-14) +2*a(n-15) +a(n-16)