The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #9 Oct 20 2014 17:14:58
%S 1,2,4,8,14,24,42,75,138,261,500,960,1838,3505,6669,12698,24254,46533,
%T 89679,173472,336440,653616,1271244,2474786,4822414,9407279,18372967,
%U 35926706,70331337,137822864,270318832,530594784,1042182332,2048302421
%N Number of binary strings of length n with equal numbers of 0010 and 1100 substrings
%H R. H. Hardin, <a href="/A164172/b164172.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