login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A164173
Number of binary strings of length n with equal numbers of 0010 and 1101 substrings
1
1, 2, 4, 8, 14, 24, 40, 66, 110, 188, 334, 616, 1172, 2274, 4458, 8766, 17220, 33728, 65854, 128258, 249442, 484968, 943446, 1837620, 3584900, 7005162, 13710046, 26869130, 52718224, 103529290, 203460640, 400085312, 787119046, 1549247596
OFFSET
0,2
LINKS
Shalosh B. Ekhad and Doron Zeilberger, Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type, 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]
CROSSREFS
Sequence in context: A118544 A222037 A019274 * A164162 A164402 A164165
KEYWORD
nonn
AUTHOR
R. H. Hardin, Aug 11 2009
STATUS
approved