login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

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!)
A164509 Number of binary strings of length n with no substrings equal to 0101, 0110, or 1010. 1
1, 2, 4, 8, 13, 22, 38, 65, 112, 193, 331, 568, 976, 1677, 2881, 4949, 8501, 14603, 25086, 43094, 74028, 127167, 218451, 375262, 644637, 1107377, 1902285, 3267802, 5613529, 9643090, 16565191, 28456184, 48882890, 83972502, 144250496, 247797851, 425674618 (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 5000 terms from R. H. Hardin)

Index entries for linear recurrences with constant coefficients, signature (1,0,1,1,1,1).

FORMULA

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

CROSSREFS

Sequence in context: A164411 A074467 A018066 * A164415 A233274 A336980

Adjacent sequences:  A164506 A164507 A164508 * A164510 A164511 A164512

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 15:36 EST 2021. Contains 349526 sequences. (Running on oeis4.)