|
%I #25 Apr 03 2019 03:02:30
%S 1,2,4,8,13,20,30,43,61,85,117,160,217,293,394,528,706,942,1255,1670,
%T 2220,2949,3915,5195,6891,9138,12115,16059,21284,28206,37376,49524,
%U 65617,86936,115178,152591,202153,267809,354785,470004,622637,824833,1092686,1447516
%N Number of binary strings of length n with no substrings equal to 0001, 0110, or 0111.
%H Alois P. Heinz, <a href="/A164476/b164476.txt">Table of n, a(n) for n = 0..2500</a> (first 500 terms from R. H. Hardin)
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-1,-1,1).
%F G.f.: (x^5-x^3-1)/((x^3+x^2-1)*(x-1)^2). - _R. J. Mathar_, Jan 19 2011
%t LinearRecurrence[{2,0,-1,-1,1},{1,2,4,8,13,20},44] (* _Harvey P. Dale_, Apr 13 2016; amended for offset 0 by _Georg Fischer_, Apr 03 2019 *)
%o (PARI) x='x+O('x^44); Vec((x^5-x^3-1)/((x^3+x^2-1)*(x-1)^2)) \\ _Georg Fischer_, Apr 03 2019
%K nonn,easy
%O 0,2
%A _R. H. Hardin_, Aug 14 2009
%E Edited by _Alois P. Heinz_, Oct 27 2017
|
