The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #15 Mar 30 2024 04:37:22
%S 13,21,35,58,96,159,264,438,727,1206,2001,3319,5506,9133,15151,25133,
%T 41694,69165,114739,190338,315752,523795,868921,1441440,2391195,
%U 3966724,6580367,10916098,18108619,30040197,49833403,82668121,137137355
%N Number of binary strings of length n with no substrings equal to 0010 0110 or 1001.
%H R. H. Hardin, <a href="/A164496/b164496.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 (2,0,-2,2,-1,1).
%F G.f.: -x^4*(13-5*x-7*x^2+14*x^3-4*x^4+8*x^5) / ( -1+2*x-2*x^3+2*x^4-x^5+x^6 ). - _R. J. Mathar_, Jan 19 2011
%K nonn,easy
%O 4,1
%A _R. H. Hardin_, Aug 14 2009