|
%I #14 Mar 30 2024 04:36:44
%S 13,22,38,65,111,190,326,559,958,1642,2814,4822,8263,14160,24266,
%T 41585,71265,122128,209292,358665,614646,1053322,1805084,3093384,
%U 5301153,9084622,15568378,26679633,45721063,78352486,134273170,230104815
%N Number of binary strings of length n with no substrings equal to 0010 0101 or 1001.
%H R. H. Hardin, <a href="/A164493/b164493.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,-1,1,-1,1,0,1).
%F G.f.: -x^4*(13-4*x+7*x^2-2*x^3+10*x^4+4*x^5+8*x^6) / ( -1+2*x-x^2+x^3-x^4+x^5+x^7 ). - _R. J. Mathar_, Jan 19 2011
%K nonn,easy
%O 4,1
%A _R. H. Hardin_, Aug 14 2009
|
