|
%I #13 May 20 2021 13:04:53
%S 13,23,40,70,122,213,372,650,1135,1982,3462,6047,10561,18445,32216,
%T 56268,98275,171643,299787,523599,914499,1597232,2789674,4872353,
%U 8509886,14863080,25959362,45339756,79188896,138308673,241565308,421909890
%N Number of binary strings of length n with no substrings equal to 0000 0101 or 1010.
%H R. H. Hardin, <a href="/A164434/b164434.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 (1,0,2,1,0,-1,-1).
%F G.f.: -x^4*(-13-10*x-17*x^2-4*x^3+7*x^4+12*x^5+8*x^6) ) / ( 1-x-2*x^3-x^4+x^6+x^7 ). - _R. J. Mathar_, Jan 19 2011
%F a(n) = a(n-1)+2*a(n-3)+a(n-4)-a(n-6)-a(n-7). - _Wesley Ivan Hurt_, May 20 2021
%K nonn
%O 4,1
%A _R. H. Hardin_ Aug 14 2009
|
