The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A164451 Number of binary strings of length n with no substrings equal to 0001 0010 or 1100 1

%I #12 Dec 30 2017 15:57:48

%S 13,21,34,56,93,156,261,437,731,1223,2046,3424,5730,9590,16050,26862,

%T 44957,75242,125928,210759,352736,590356,988048,1653645,2767620,

%U 4632023,7752378,12974756,21715181,36343581,60826381,101801984,170380742

%N Number of binary strings of length n with no substrings equal to 0001 0010 or 1100

%H R. H. Hardin, <a href="/A164451/b164451.txt">Table of n, a(n) for n=4..500</a>

%H <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-1,0,0,1,-1).

%F G.f. -x^4*(-13+5*x+8*x^2-x^3-2*x^4-4*x^5+8*x^6) / ( (x-1)*(1+x)*(x^5-x^4+x^3-x^2+2*x-1) ). - R. J. Mathar, Jan 19 2011

%t LinearRecurrence[{2,0,-1,0,0,1,-1},{13,21,34,56,93,156,261},40] (* _Harvey P. Dale_, Dec 30 2017 *)

%K nonn

%O 4,1

%A _R. H. Hardin_ Aug 14 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 8 03:15 EST 2023. Contains 367662 sequences. (Running on oeis4.)