|
%I #15 Nov 03 2023 15:36:58
%S 1,2,4,8,14,25,46,83,151,278,510,940,1744,3242,6051,11346,21341,40285,
%T 76326,145065,276573,528901,1014219,1949950,3758249,7259903,14053760,
%U 27258744,52966596,103091048,200958322,392285713,766762495,1500497739
%N Number of binary strings of length n with equal numbers of 0000 and 0011 substrings.
%H Alois P. Heinz, <a href="/A164149/b164149.txt">Table of n, a(n) for n = 0..1000</a> (first 501 terms from R. H. Hardin)
%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
|
