login
A384497
a(n) is the number of binary strings of length n which contain exactly one run of 1s of even length.
2
0, 0, 1, 2, 6, 12, 28, 56, 119, 236, 479, 940, 1859, 3612, 7028, 13538, 26051, 49820, 95098, 180774, 342944, 648648, 1224517, 2306338, 4336449, 8138516, 15250965, 28535528, 53320792, 99504804, 185474501, 345332950, 642310142, 1193510160, 2215702468, 4109801864
OFFSET
0,4
LINKS
Félix Balado and Guénolé C. M. Silvestre, Systematic Enumeration of Fundamental Quantities Involving Runs in Binary Strings, arXiv:2602.10005 [math.CO], 2026. See pp. 38, 105.
FORMULA
G.f.: ((1 - x^2) * x^2)/(1 - x - 2 * x^2 + x^3)^2.
EXAMPLE
a(3)=2 because of the strings 011 and 110.
MATHEMATICA
CoefficientList[Series[((1 - x^2) * x^2)/(1 - x - 2 * x^2 + x^3)^2, {x, 0, 35}], x] (* Stefano Spezia, Jun 02 2025 *)
CROSSREFS
Column k=1 of A391669.
Cf. A029907.
Sequence in context: A327727 A222970 A112510 * A284449 A011949 A350271
KEYWORD
nonn,easy
AUTHOR
Félix Balado, May 31 2025
STATUS
approved