Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Aug 04 2017 03:46:56
%S 13,22,38,66,113,193,331,568,974,1669,2861,4905,8409,14415,24711,
%T 42362,72621,124493,213416,365856,627182,1075169,1843146,3159678,
%U 5416590,9285581,15918135,27288225,46779804,80193932,137475281,235671857
%N Number of binary strings of length n with no substrings equal to 0001 0010 or 0100
%H R. H. Hardin, <a href="/A164445/b164445.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,1,0,1,0,-1).
%F G.f.: -x^4*(-13-9*x-3*x^2-6*x^3+4*x^4+8*x^5) / ( 1-x-x^2-x^4+x^6 ). - _R. J. Mathar_, Jan 19 2011
%o (PARI) x='x+O('x^99); Vec(x^4*(13+9*x+3*x^2+6*x^3-4*x^4-8*x^5)/(1-x-x^2-x^4+x^6)) \\ _Altug Alkan_, Aug 04 2017
%K nonn
%O 4,1
%A _R. H. Hardin_, Aug 14 2009