|
%I #12 Oct 02 2021 16:27:33
%S 13,21,35,59,100,170,289,492,838,1428,2434,4149,7073,12058,20557,
%T 35047,59751,101869,173676,296100,504821,860670,1467358,2501702,
%U 4265158,7271679,12397505,21136540,36035745,61437441,104744863,178579807
%N Number of binary strings of length n with no substrings equal to 0001 0110 or 1000.
%H R. H. Hardin, <a href="/A164477/b164477.txt">Table of n, a(n) for n=4..500</a>
%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-1,0,1,-1).
%F G.f.: -x^4*(-13+5*x+7*x^2-2*x^3-3*x^4+8*x^5) / ( (x-1)*(x^5+x^2+x-1) ). - _R. J. Mathar_, Jan 19 2011
%F a(n) = 2*a(n-1)-a(n-3)+a(n-5)-a(n-6). - _Wesley Ivan Hurt_, Oct 02 2021
%K nonn
%O 4,1
%A _R. H. Hardin_, Aug 14 2009
|
