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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A164459 Number of binary strings of length n with no substrings equal to 0001 0011 or 1100 1
 13, 21, 35, 58, 96, 159, 264, 439, 730, 1215, 2023, 3369, 5612, 9349, 15576, 25952, 43241, 72050, 120054, 200043, 333329, 555423, 925499, 1542157, 2569695, 4281884, 7134907, 11888905, 19810501, 33010271, 55005074, 91655056, 152724992 (list; graph; refs; listen; history; text; internal format)
 OFFSET 4,1 LINKS R. H. Hardin, Table of n, a(n) for n=4..500 Index entries for linear recurrences with constant coefficients, signature (2,0,0,-2,1,-1,1). FORMULA G.f. -x^4*(13-5*x-7*x^2-12*x^3+6*x^4-4*x^5+8*x^6) / ( (x^5+x^4+2*x^3+x^2-1)*(x-1)^2 ). - R. J. Mathar, Jan 19 2011 a(0)=13, a(1)=21, a(2)=35, a(3)=58, a(4)=96, a(5)=159, a(6)=264, a(n)= 2*a(n-1)-2*a(n-4)+a(n-5)-a(n-6)+a(n-7) [From Harvey P. Dale, May 06 2011] MATHEMATICA LinearRecurrence[{2, 0, 0, -2, 1, -1, 1}, {13, 21, 35, 58, 96, 159, 264}, 40] (* May 06 2011 *) CROSSREFS Sequence in context: A034292 A163113 A164496 * A164453 A164465 A164471 Adjacent sequences: A164456 A164457 A164458 * A164460 A164461 A164462 KEYWORD nonn AUTHOR R. H. Hardin Aug 14 2009 STATUS approved

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 2 11:37 EST 2022. Contains 358493 sequences. (Running on oeis4.)