

A164137


Number of binary strings of length n with equal numbers of 000 and 001 substrings.


1



1, 2, 4, 6, 11, 19, 35, 61, 111, 200, 369, 676, 1256, 2337, 4392, 8273, 15686, 29837, 57038, 109362, 210448, 406029, 785573, 1523217, 2959853, 5761671, 11234619, 21937768, 42894822, 83969696, 164552423, 322773812, 633679446, 1245032098
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


LINKS

R. H. Hardin, Table of n, a(n) for n=0..500
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: A000786 A289080 A000694 * A018170 A113913 A002097
Adjacent sequences: A164134 A164135 A164136 * A164138 A164139 A164140


KEYWORD

nonn


AUTHOR

R. H. Hardin, Aug 11 2009


STATUS

approved



