|
%I #19 Apr 03 2024 15:14:49
%S 1,2,4,8,13,22,37,64,110,190,329,570,988,1713,2971,5153,8938,15504,
%T 26894,46652,80926,140381,243517,422426,732778,1271143,2205040,
%U 3825063,6635303,11510202,19966647,34635969,60082715,104224965,180798144,313628975,544049468
%N Number of binary strings of length n with no substrings equal to 0000, 0111 or 1110.
%H Alois P. Heinz, <a href="/A164443/b164443.txt">Table of n, a(n) for n = 0..2000</a> (terms n = 4..500 from R. H. Hardin)
%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1,0,-1,-1).
%F G.f.: -(x^8+2*x^7+3*x^6+2*x^5+x^4-x^3-x^2-x-1) / ( (x-1)*(x^5+2*x^4+2*x^3+x^2-1) ). - _R. J. Mathar_, Jan 19 2011
%K nonn,easy
%O 0,2
%A _R. H. Hardin_, Aug 14 2009
%E a(0)-a(3) prepended by _Alois P. Heinz_, Apr 03 2024
|
