|
%I #15 Feb 14 2018 09:51:52
%S 1,2,4,8,13,22,38,65,112,193,331,568,976,1677,2881,4949,8501,14603,
%T 25086,43094,74028,127167,218451,375262,644637,1107377,1902285,
%U 3267802,5613529,9643090,16565191,28456184,48882890,83972502,144250496,247797851,425674618
%N Number of binary strings of length n with no substrings equal to 0101, 0110, or 1010.
%H Alois P. Heinz, <a href="/A164509/b164509.txt">Table of n, a(n) for n = 0..2000</a> (first 5000 terms from R. H. Hardin)
%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,1,1,1,1).
%F G.f.: -(x+1)*(x^2+1)*(x^3+x^2+1)/(x^6+x^5+x^4+x^3+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
|
