|
%I #13 Apr 02 2024 04:00:42
%S 13,20,31,50,82,134,217,350,565,914,1480,2396,3877,6272,10147,16418,
%T 26566,42986,69553,112538,182089,294626,476716,771344,1248061,2019404,
%U 3267463,5286866,8554330,13841198,22395529,36236726,58632253,94868978
%N Number of binary strings of length n with no substrings equal to 0001 0100 or 0110.
%H R. H. Hardin, <a href="/A164463/b164463.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 (2,-1,0,1).
%F G.f.: -x^4*(13-6*x+4*x^2+8*x^3) / ( (x^2-x+1)*(x^2+x-1) ). - _R. J. Mathar_, Jan 19 2011
%K nonn,easy
%O 4,1
%A _R. H. Hardin_, Aug 14 2009
|
