|
%I #16 Apr 03 2024 03:20:13
%S 13,21,34,56,93,156,261,437,731,1223,2046,3424,5730,9590,16050,26862,
%T 44957,75242,125928,210759,352736,590356,988048,1653645,2767620,
%U 4632023,7752378,12974756,21715181,36343581,60826381,101801984,170380742
%N Number of binary strings of length n with no substrings equal to 0001 0010 or 1100.
%H R. H. Hardin, <a href="/A164451/b164451.txt">Table of n, a(n) for n=4..500</a>
%H <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-1,0,0,1,-1).
%F G.f.: -x^4*(-13+5*x+8*x^2-x^3-2*x^4-4*x^5+8*x^6) / ( (x-1)*(1+x)*(x^5-x^4+x^3-x^2+2*x-1) ). - _R. J. Mathar_, Jan 19 2011
%t LinearRecurrence[{2,0,-1,0,0,1,-1},{13,21,34,56,93,156,261},40] (* _Harvey P. Dale_, Dec 30 2017 *)
%K nonn,easy,changed
%O 4,1
%A _R. H. Hardin_, Aug 14 2009
|
