|
%I #14 Apr 04 2024 04:26:29
%S 13,21,34,57,95,158,262,435,722,1199,1991,3306,5489,9114,15133,25127,
%T 41721,69274,115023,190985,317113,526537,874266,1451638,2410311,
%U 4002099,6645116,11033602,18320278,30419131,50508160,83864139,139248664
%N Number of binary strings of length n with no substrings equal to 0000 0101 or 0110.
%H R. H. Hardin, <a href="/A164432/b164432.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,1,1,0,1).
%F G.f.: -x^4*(13+8*x+13*x^2+10*x^3+4*x^4+8*x^5) / ( -1+x+x^3+x^4+x^6 ). - _R. J. Mathar_, Jan 19 2011
%K nonn,easy
%O 4,1
%A _R. H. Hardin_, Aug 14 2009
|
