|
%I #17 Apr 08 2024 06:58:37
%S 13,21,33,51,79,122,188,289,443,678,1037,1586,2426,3711,5676,8680,
%T 13272,20292,31025,47436,72529,110896,169557,259245,396371,606028,
%U 926583,1416697,2166058,3311792,5063556,7741905,11836953,18098061,27670963
%N Number of binary strings of length n with no substrings equal to 0010 0110 or 1101.
%H R. H. Hardin, <a href="/A164499/b164499.txt">Table of n, a(n) for n = 4..500</a>
%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1,0,1,-1).
%F G.f.: -x^4*(-13+18*x-9*x^2-2*x^3-4*x^4+8*x^5) / ( (x-1)*(x^5-x^2+2*x-1) ). - _R. J. Mathar_, Jan 19 2011
%K nonn,easy
%O 4,1
%A _R. H. Hardin_, Aug 14 2009
|
