|
%I #17 Mar 31 2024 01:56:58
%S 13,21,33,52,81,126,195,301,464,715,1101,1695,2609,4015,6178,9506,
%T 14626,22503,34622,53267,81952,126084,193981,298440,459150,706402,
%U 1086798,1672036,2572423,3957665,6088855,9367684,14412151,22173046,34113157
%N Number of binary strings of length n with no substrings equal to 0001 1010 or 1101.
%H R. H. Hardin, <a href="/A164488/b164488.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 (2,-1,1,-1,0,1,-1)
%F G.f.: -x^4*(-13+5*x-4*x^2+6*x^3-2*x^4-4*x^5+8*x^6) / ( (x-1)*(x^6+x^3+x-1) ). - _R. J. Mathar_, Jan 19 2011
%t LinearRecurrence[{2,-1,1,-1,0,1,-1},{13,21,33,52,81,126,195},40] (* _Harvey P. Dale_, Dec 02 2014 *)
%K nonn,easy
%O 4,1
%A _R. H. Hardin_, Aug 14 2009
|
