%I #16 Oct 27 2017 17:47:07
%S 1,2,4,8,13,22,36,59,97,160,263,433,712,1172,1928,3173,5220,8590,
%T 14133,23256,38264,62962,103596,170461,280475,461501,759354,1249456,
%U 2055862,3382748,5566002,9158377,15069284,24795193,40798275,67129981,110456415,181746303
%N Number of binary strings of length n with no substrings equal to 0000, 0110, or 1111.
%H Alois P. Heinz, <a href="/A164441/b164441.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 (0,1,1,2,1,1).
%F G.f.: -(x+1)*(x^2+1)*(x^5+x^4+2*x^3+x^2+x+1)/(x^6+x^5+2*x^4+x^3+x^2-1). - _R. J. Mathar_, Jan 19 2011
%K nonn,easy
%O 0,2
%A _R. H. Hardin_, Aug 14 2009
%E Edited by _Alois P. Heinz_, Oct 27 2017
|