login
The OEIS is supported by the many generous donors to the OEIS 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 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!)
A164407 Number of binary strings of length n with no substrings equal to 0000 0001 or 0010 1
13, 23, 40, 71, 124, 218, 382, 671, 1177, 2066, 3625, 6362, 11164, 19592, 34381, 60335, 105880, 185807, 326068, 572210, 1004158, 1762175, 3092401, 5426786, 9523345, 16712306, 29328052, 51467144, 90318541, 158497991, 278144584, 488109719 (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 (1, 1, 0, 1).

FORMULA

G.f.: x^4*(13+10*x+4*x^2+8*x^3)/((1+x)*(1-2*x+x^2-x^3)). - R. J. Mathar, Nov 28 2011

MATHEMATICA

LinearRecurrence[{1, 1, 0, 1}, {13, 23, 40, 71}, 50] (* G. C. Greubel, Sep 19 2017 *)

PROG

(PARI) x='x+O('x^50); Vec(x^4*(13+10*x+4*x^2+8*x^3)/((1+x)*(1-2*x+x^2-x^3))) \\ G. C. Greubel, Sep 19 2017

CROSSREFS

Sequence in context: A164491 A164434 A164494 * A259216 A339867 A135283

Adjacent sequences: A164404 A164405 A164406 * A164408 A164409 A164410

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 02:30 EST 2022. Contains 358572 sequences. (Running on oeis4.)