|
%I #17 Apr 04 2024 04:23:20
%S 1,2,4,8,13,21,33,55,92,156,260,433,717,1193,1985,3310,5512,9180,
%T 15277,25433,42337,70495,117368,195416,325336,541649,901769,1501361,
%U 2499601,4161594,6928588,11535360,19205085,31974413,53233921,88628791,147557332,245667060
%N Number of binary strings of length n with no substrings equal to 0000, 0010, or 0110.
%H Alois P. Heinz, <a href="/A164419/b164419.txt">Table of n, a(n) for n = 0..2000</a> (first 500 terms from R. H. Hardin)
%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1,1,1,1).
%F G.f.: -(x^5+2*x^4+3*x^3+x^2+x+1)/(x^6+x^5+x^4-x^3+x^2+x-1). - _R. J. Mathar_, Nov 30 2011
%K nonn,easy
%O 0,2
%A _R. H. Hardin_, Aug 14 2009
%E Edited by _Alois P. Heinz_, Nov 02 2017
|
