%I #9 Oct 20 2014 17:14:58
%S 1,2,4,8,14,28,52,100,192,368,710,1368,2644,5116,9912,19232,37356,
%T 72648,141432,275624,537664,1049792,2051526,4012464,7853948,15384748,
%U 30157944,59157072,116115556,228054696,448166392,881208504,1733585856,3412149856
%N Number of binary strings of length n with equal numbers of 0101 and 1010 substrings
%H R. H. Hardin, <a href="/A164176/b164176.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