|
%I #15 Apr 03 2024 03:17:21
%S 13,22,37,62,103,172,286,475,789,1311,2177,3615,6003,9968,16551,27482,
%T 45632,75768,125806,208890,346843,575901,956231,1587734,2636286,
%U 4377310,7268120,12068043,20037872,33271038,55243489,91726716,152303748
%N Number of binary strings of length n with no substrings equal to 0001 0010 or 0101.
%H R. H. Hardin, <a href="/A164446/b164446.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,1,-1).
%F G.f.: -x^4*(-13+4*x-6*x^2+3*x^3+6*x^4-4*x^5+8*x^6) / ( (x-1)*(x^6+x^4+x^3+x-1) ). - _R. J. Mathar_, Jan 19 2011
%t LinearRecurrence[{2,-1,1,0,-1,1,-1},{13,22,37,62,103,172,286},40] (* _Harvey P. Dale_, Mar 12 2016 *)
%K nonn,easy
%O 4,1
%A _R. H. Hardin_, Aug 14 2009
|
