|
%I #9 Oct 20 2014 17:14:58
%S 1,2,4,8,14,24,40,68,118,212,394,752,1460,2860,5616,11016,21554,42060,
%T 81910,159352,309990,603464,1176250,2296184,4489444,8790452,17233756,
%U 33822464,66435460,130584824,256821496,505337672,994772026,1959055556
%N Number of binary strings of length n with equal numbers of 0001 and 1110 substrings
%H R. H. Hardin, <a href="/A164165/b164165.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
|
