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.

A209231 Number of binary words of length n such that there is at least one 0 and every run of consecutive 0's is of length >= 4.

Original entry on oeis.org

0, 0, 0, 0, 1, 3, 6, 10, 15, 22, 33, 51, 80, 125, 193, 295, 449, 684, 1045, 1600, 2451, 3752, 5738, 8770, 13403, 20488, 31326, 47903, 73251, 112003, 171244, 261812, 400284, 612008, 935736, 1430709, 2187495, 3344566, 5113646, 7818463, 11953990
Offset: 0

Views

Author

Geoffrey Critzer, Jan 12 2013

Keywords

Examples

			a(5) = 3 because we have: {0,0,0,0,0}, {0,0,0,0,1}, {1,0,0,0,0}.
		

Crossrefs

Programs

  • Mathematica
    nn=40; a=x^4/(1-x); CoefficientList[Series[(a+1)/((1-a x/(1-x)))*1/(1-x)-1/(1-x), {x,0,nn}], x]

Formula

O.g.f.: x^4/((1-x)*(1-2*x+x^2-x^5)), see Mathematica code for unsimplified form.