%I #9 Oct 20 2014 17:14:58
%S 1,2,4,8,14,24,42,76,142,270,518,998,1924,3712,7168,13856,26826,52018,
%T 101024,196496,382710,746326,1457084,2847688,5570840,10907820,
%U 21375520,41921164,82274428,161581188,317535452,624383548,1228435862,2418134866
%N Number of binary strings of length n with equal numbers of 0001 and 1100 substrings
%H R. H. Hardin, <a href="/A164164/b164164.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
|