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 #12 Apr 04 2024 04:25:52
%S 13,22,37,63,105,177,297,500,839,1411,2370,3984,6693,11249,18901,
%T 31764,53374,89694,150720,253277,425607,715204,1201837,2019598,
%U 3393765,5702960,9583358,16104079,27061604,45474878,76416880,128412479,215786884
%N Number of binary strings of length n with no substrings equal to 0000 0011 or 0110.
%H R. H. Hardin, <a href="/A164427/b164427.txt">Table of n, a(n) for n=4..500</a>
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,0,1,-1).
%F G.f.: -x^4*(-13-9*x-2*x^2-4*x^3+8*x^4) / ( 1-x-x^2-x^4+x^5 ). - _R. J. Mathar_, Dec 01 2011
%K nonn,easy
%O 4,1
%A _R. H. Hardin_, Aug 14 2009