login
Number of binary strings of length n with no substrings equal to 0001 0100 or 1010.
1

%I #15 Apr 02 2024 04:01:18

%S 13,21,35,59,99,165,274,455,756,1256,2086,3464,5752,9551,15859,26333,

%T 43724,72600,120546,200156,332341,551822,916250,1521349,2526060,

%U 4194290,6964232,11563465,19200067,31879940,52933699,87891523,145935764

%N Number of binary strings of length n with no substrings equal to 0001 0100 or 1010.

%H R. H. Hardin, <a href="/A164465/b164465.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,0,-1,1,-1).

%F G.f.: -x^4*(-13+5*x-6*x^2+3*x^3+5*x^4-4*x^5+8*x^6) / ( (x-1)*(x^6+x^4+x^3+x-1) ). - _R. J. Mathar_, Jan 19 2011

%t LinearRecurrence[{2,-1,1,0,-1,1,-1},{13,21,35,59,99,165,274},40] (* _Harvey P. Dale_, Mar 17 2021 *)

%K nonn,easy

%O 4,1

%A _R. H. Hardin_, Aug 14 2009