|
%I #18 Mar 30 2024 02:59:54
%S 13,21,34,55,87,136,211,326,501,766,1166,1769,2676,4037,6075,9122,
%T 13671,20453,30551,45569,67881,100998,150109,222879,330625,490048,
%U 725783,1074153,1588694,2348284,3469100,5122202,7559387,11151195,16442768
%N Number of binary strings of length n with no substrings equal to 0011 0101 or 0110.
%H R. H. Hardin, <a href="/A164503/b164503.txt">Table of n, a(n) for n=4..500</a>
%H <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1,1,0,-1,0,-1).
%F G.f.: -x^4*(-13+5*x-5*x^2+5*x^3+10*x^4+4*x^5+8*x^6) / ( (x^3+x-1)*(x^4+x-1) ). - _R. J. Mathar_, Jan 19 2011
%t LinearRecurrence[{2,-1,1,0,-1,0,-1},{13,21,34,55,87,136,211},40] (* _Harvey P. Dale_, Sep 28 2017 *)
%K nonn,easy
%O 4,1
%A _R. H. Hardin_, Aug 14 2009
|
