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 Apr 02 2024 03:55:52
%S 13,22,37,61,101,167,276,456,753,1244,2055,3394,5606,9260,15295,25263,
%T 41728,68924,113844,188040,310593,513018,847370,1399632,2311824,
%U 3818524,6307195,10417825,17207503,28422261,46946087,77542569,128079896
%N Number of binary strings of length n with no substrings equal to 0001 0101 or 1010.
%H R. H. Hardin, <a href="/A164472/b164472.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,0,2,0,0,-1).
%F G.f.: -x^4*(-13-9*x-15*x^2+2*x^3+4*x^4+8*x^5) / ( 1-x-2*x^3+x^6 ). - _R. J. Mathar_, Jan 19 2011
%K nonn,easy
%O 4,1
%A _R. H. Hardin_, Aug 14 2009