The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A164507 Number of binary strings of length n with no substrings equal to 0011, 0110, or 1100. 1
 1, 2, 4, 8, 13, 22, 37, 63, 106, 180, 304, 515, 871, 1475, 2496, 4226, 7153, 12110, 20500, 34706, 58754, 99469, 168396, 285091, 482651, 817121, 1383372, 2342034, 3965038, 6712778, 11364682, 19240337, 32573779, 55147244, 93364021, 158064880, 267603180 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..2000 (first 500 terms from R. H. Hardin) Index entries for linear recurrences with constant coefficients, signature (2,0,-1,1,-1,0,-1). FORMULA G.f.: -(x^8+x^7+x^6+x^5+2*x^4-x^3-1)/(x^7+x^5-x^4+x^3-2*x+1). - R. J. Mathar, Jan 19 2011 CROSSREFS Sequence in context: A023600 A164437 A164428 * A164414 A164411 A074467 Adjacent sequences:  A164504 A164505 A164506 * A164508 A164509 A164510 KEYWORD nonn,easy AUTHOR R. H. Hardin, Aug 14 2009 EXTENSIONS Edited by Alois P. Heinz, Feb 14 2018 STATUS approved

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

Last modified December 9 08:41 EST 2021. Contains 349627 sequences. (Running on oeis4.)