reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
Number of binary strings of length n with no substrings equal to 0000 0010 or 1101.
<a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1,0,1,0,-1).
G.f. : -x^4*(-13+5*x-4*x^2-6*x^3+4*x^4+8*x^5) / ( (x-1)*(x^5+x^4+x-1) ). - _R. J. Mathar, _, Dec 01 2011
nonn,easy
R. H. Hardin , Aug 14 2009
approved
editing
<a href="/index/Rec">Index to sequences with entries for linear recurrences with constant coefficients</a>, signature (2,-1,0,1,0,-1).
<a href="/index/Rec#recLCC">Index to sequences with linear recurrences with constant coefficients</a>, signature (2,-1,0,1,0,-1).
_R. H. Hardin (rhhardin(AT)att.net) _ Aug 14 2009
editing
approved
<a href="/index/Rec#recLCC">Index to sequences with linear recurrences with constant coefficients</a>, signature (2,-1,0,1,0,-1).
G.f. -x^4*(-13+5*x-4*x^2-6*x^3+4*x^4+8*x^5) / ( (x-1)*(x^5+x^4+x-1) ). - R. J. Mathar, Dec 01 2011
approved
editing
R. H. Hardin, <a href="/A164424/b164424.txt">Table of n, a(n) for n=4..500</a>
nonn,new
nonn