login
Number of binary strings of length n with no substrings equal to 0101, 0110, or 1001.
1

%I #14 Feb 14 2018 09:59:14

%S 1,2,4,8,13,20,33,56,93,152,250,414,685,1130,1864,3078,5084,8394,

%T 13857,22878,37775,62370,102975,170016,280708,463468,765213,1263410,

%U 2085966,3444058,5686348,9388500,15500977,25593048,42255665,69766644,115188925,190183848

%N Number of binary strings of length n with no substrings equal to 0101, 0110, or 1001.

%H Alois P. Heinz, <a href="/A164508/b164508.txt">Table of n, a(n) for n = 0..2000</a> (first 500 terms from R. H. Hardin)

%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1,0,2,-2,1).

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

%K nonn,easy

%O 0,2

%A _R. H. Hardin_, Aug 14 2009

%E Edited by _Alois P. Heinz_, Feb 14 2018