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!)
A164144 Number of binary strings of length n with equal numbers of 001 and 101 substrings 1
1, 2, 4, 6, 8, 11, 18, 36, 76, 153, 289, 525, 954, 1787, 3464, 6832, 13452, 26207, 50603, 97525, 188805, 367994, 720805, 1414179, 2772486, 5428759, 10626469, 20818945, 40850896, 80275617, 157897960, 310707852, 611510788, 1203795095, 2370700373 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Seems to obey an 8-term hypergeometric recurrence with cubic polynomial coefficients. - R. J. Mathar, Nov 28 2011.

LINKS

R. H. Hardin, Table of n, a(n) for n=0..500

Shalosh B. Ekhad and Doron Zeilberger, Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type, arXiv preprint arXiv:1112.6207, 2011. See subpages for rigorous derivations of g.f., recurrence, asymptotics for this sequence. [From N. J. A. Sloane, Apr 07 2012]

CROSSREFS

Sequence in context: A039823 A284617 A079972 * A071241 A247123 A332240

Adjacent sequences:  A164141 A164142 A164143 * A164145 A164146 A164147

KEYWORD

nonn

AUTHOR

R. H. Hardin Aug 11 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 20:19 EST 2021. Contains 349588 sequences. (Running on oeis4.)