|
%I #14 Sep 20 2017 02:53:39
%S 13,23,40,71,124,218,382,671,1177,2066,3625,6362,11164,19592,34381,
%T 60335,105880,185807,326068,572210,1004158,1762175,3092401,5426786,
%U 9523345,16712306,29328052,51467144,90318541,158497991,278144584,488109719
%N Number of binary strings of length n with no substrings equal to 0000 0001 or 0010
%H R. H. Hardin, <a href="/A164407/b164407.txt">Table of n, a(n) for n=4..500</a>
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1, 0, 1).
%F G.f.: x^4*(13+10*x+4*x^2+8*x^3)/((1+x)*(1-2*x+x^2-x^3)). - _R. J. Mathar_, Nov 28 2011
%t LinearRecurrence[{1,1,0,1}, {13, 23, 40, 71}, 50] (* _G. C. Greubel_, Sep 19 2017 *)
%o (PARI) x='x+O('x^50); Vec(x^4*(13+10*x+4*x^2+8*x^3)/((1+x)*(1-2*x+x^2-x^3))) \\ _G. C. Greubel_, Sep 19 2017
%K nonn
%O 4,1
%A _R. H. Hardin_, Aug 14 2009
|
