%I #9 Oct 20 2014 17:14:58
%S 1,2,4,8,14,26,50,96,184,352,678,1310,2534,4908,9520,18496,35980,
%T 70068,136596,266560,520672,1017920,1991686,3900022,7642470,14986604,
%U 29407560,57741232,113441092,222996908,438590236,863056256,1699136816,3346697088
%N Number of binary strings of length n with equal numbers of 0010 and 0100 substrings
%H R. H. Hardin, <a href="/A164166/b164166.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
|