|
%I #9 Oct 20 2014 17:14:58
%S 1,2,4,8,14,24,40,66,110,188,334,616,1172,2274,4458,8766,17220,33728,
%T 65854,128258,249442,484968,943446,1837620,3584900,7005162,13710046,
%U 26869130,52718224,103529290,203460640,400085312,787119046,1549247596
%N Number of binary strings of length n with equal numbers of 0010 and 1101 substrings
%H R. H. Hardin, <a href="/A164173/b164173.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
|
