|
%I #13 Apr 03 2024 15:14:40
%S 13,21,34,54,84,131,205,318,492,764,1185,1833,2838,4398,6808,10535,
%T 16313,25258,39092,60512,93685,145021,224474,347494,537932,832683,
%U 1288965,1995334,3088732,4781236,7401289,11457105,17735278,27453790,42498032
%N Number of binary strings of length n with no substrings equal to 0000 0101 or 0111.
%H R. H. Hardin, <a href="/A164433/b164433.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,-1,-1).
%F G.f.: -x^4*(-13-8*x-13*x^2+6*x^3+12*x^4+8*x^5) / ( (x-1)*(x^5+2*x^4+2*x^3-1) ). - _R. J. Mathar_, Jan 19 2011
%K nonn,easy
%O 4,1
%A _R. H. Hardin_, Aug 14 2009
|
