|
%I #19 Apr 03 2024 15:14:55
%S 1,2,4,8,13,22,37,62,104,174,292,490,821,1376,2308,3870,6487,10876,
%T 18237,30576,51261,85946,144102,241600,405064,679140,1138659,1909078,
%U 3200774,5366466,8997477,15085240,25292069,42404978,71096617,119201278,199854120,335077546
%N Number of binary strings of length n with no substrings equal to 0000, 0101, or 1111.
%H Alois P. Heinz, <a href="/A164437/b164437.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 (0,0,2,3,2,1).
%F G.f.: -(x+1)^2*(x^2+1)^3/(x^6+2*x^5+3*x^4+2*x^3-1). - _R. J. Mathar_, Jan 19 2011
%K nonn,easy
%O 0,2
%A _R. H. Hardin_, Aug 14 2009
%E a(0)-a(3) from _Alois P. Heinz_, Jun 11 2021
|
