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!)
 A164142 Number of binary strings of length n with equal numbers of 001 and 011 substrings 1

%I

%S 1,2,4,6,10,16,30,56,110,208,396,740,1402,2660,5116,9860,19106,36996,

%T 71788,139332,271040,527936,1030348,2013128,3938218,7710220,15108552,

%U 29627244,58144136,114187880,224405644,441273096,868220258,1709129948

%N Number of binary strings of length n with equal numbers of 001 and 011 substrings

%H R. H. Hardin, <a href="/A164142/b164142.txt">Table of n, a(n) for n=0..500</a>

%H Shalosh B. Ekhad and Doron Zeilberger, <a href="http://arxiv.org/abs/1112.6207">Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type</a>, 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]

%F Conjecture: n*a(n)+2*(1-2n)*a(n-1) +4(n-1)*a(n-2) +2(2n-3)*a(n-3) +12(2-n)*a(n-4) +4(2n-5)*a(n-5)=0. - R. J. Mathar, Nov 28 2011

%K nonn

%O 0,2

%A _R. H. Hardin_ Aug 11 2009

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 8 01:25 EST 2021. Contains 349590 sequences. (Running on oeis4.)