|
%I #9 Oct 20 2014 17:14:58
%S 1,2,4,8,14,25,45,82,149,271,498,917,1691,3139,5850,10928,20505,38634,
%T 72998,138385,263272,502287,960850,1843234,3544809,6832244,13197224,
%U 25544126,49532000,96209710,187176395,364682314,711469670,1389763015
%N Number of binary strings of length n with equal numbers of 0000 and 0101 substrings
%H R. H. Hardin, <a href="/A164150/b164150.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]
%K nonn
%O 0,2
%A _R. H. Hardin_, Aug 11 2009
|
