|
%I #26 Apr 06 2024 14:53:11
%S 1,2,4,8,13,21,34,54,86,139,225,364,590,956,1547,2503,4050,6552,10600,
%T 17151,27751,44902,72654,117558,190213,307771,497984,805754,1303736,
%U 2109489,3413225,5522714,8935940,14458656,23394597,37853253,61247850,99101102
%N Number of binary strings of length n with no substrings equal to 0000, 0011 or 1101.
%H Alois P. Heinz, <a href="/A164431/b164431.txt">Table of n, a(n) for n = 0..2000</a> (terms n = 4..500 from R. H. Hardin)
%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1,1,-1,0,1).
%F G.f.: -(x+1)*(x^2+1)*(x^2-x+1) / ( (x^2+x-1)*(x^4-x^3+x^2-x+1) ). - _R. J. Mathar_, Jan 19 2011
%t LinearRecurrence[{2,-1,1,-1,0,1},{13,21,34,54,86,139},40] (* _Harvey P. Dale_, May 19 2016 *)
%K nonn,easy
%O 0,2
%A _R. H. Hardin_, Aug 14 2009
%E a(0)-a(3) prepended by _Alois P. Heinz_, Apr 03 2024
|
