|
%I #16 Mar 30 2024 04:36:01
%S 13,22,37,62,105,178,301,508,857,1446,2441,4122,6961,11754,19845,
%T 33504,56565,95502,161245,272246,459657,776074,1310301,2212276,
%U 3735153,6306350,10647505,17977010,30351969,51245554,86521797,146081400,246640477
%N Number of binary strings of length n with no substrings equal to 0010 0101 or 1011.
%H R. H. Hardin, <a href="/A164495/b164495.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 (2,-1,0,1,0,1).
%F G.f.: -x^4*(13-4*x+6*x^2+10*x^3+5*x^4+8*x^5) / ( -1+2*x-x^2+x^4+x^6 ). - _R. J. Mathar_, Jan 19 2011
%F a(4)=13, a(5)=22, a(6)=37, a(7)=62, a(8)=105, a(9)=178, a(n)=2*a(n-1)- a(n-2)+ a(n-4)+a(n-6). - _Harvey P. Dale_, Mar 07 2015
%t LinearRecurrence[{2,-1,0,1,0,1},{13,22,37,62,105,178},40] (* _Harvey P. Dale_, Mar 07 2015 *)
%K nonn,easy
%O 4,1
%A _R. H. Hardin_, Aug 14 2009
|
