Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #9 Oct 20 2014 17:14:58
%S 1,2,4,8,14,26,48,91,169,318,598,1136,2156,4113,7859,15081,28991,
%T 55889,107939,208945,405147,786992,1530944,2982544,5817828,11362161,
%U 22213975,43474281,85160187,166960485,327590795,643232760,1263858598,2484867793
%N Number of binary strings of length n with equal numbers of 0001 and 0010 substrings
%H R. H. Hardin, <a href="/A164155/b164155.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