|
%I #17 Apr 03 2024 15:14:45
%S 13,21,33,52,81,126,196,304,471,730,1131,1751,2711,4198,6499,10060,
%T 15574,24110,37321,57772,89433,138441,214301,331736,513525,794922,
%U 1230520,1904828,2948635,4564414,7065623,10937451,16930931,26208714,40570567
%N Number of binary strings of length n with no substrings equal to 0000 0101 or 1110.
%H R. H. Hardin, <a href="/A164436/b164436.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 (1,0,2,0,-1,-1).
%F G.f.: -x^4*(-13-8*x-12*x^2+7*x^3+13*x^4+8*x^5) / ( (x-1)*(x^5+2*x^4+2*x^3-1) ). - _R. J. Mathar_, Jan 19 2011
%t LinearRecurrence[{1,0,2,0,-1,-1},{13,21,33,52,81,126},40] (* _Harvey P. Dale_, Sep 01 2016 *)
%K nonn,easy
%O 4,1
%A _R. H. Hardin_, Aug 14 2009
|
