OFFSET
0,2
COMMENTS
Partial sums are A084858.
Partial sums of A084860.
For n >= 2, a(n) is the total number of ones in runs of ones of length 3 over all binary strings of length n+2. - Félix Balado, Sep 29 2025
LINKS
Michael De Vlieger, Table of n, a(n) for n = 0..3311
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 p. 111.
Index entries for linear recurrences with constant coefficients, signature (4,-4).
FORMULA
a(0) = 1, a(n+1) = 3*2^(n-2)*(n+3) - 0^n/4.
Equals binomial transform of nonzero terms of A026741: (1, 1, 3, 2, 5, 3, 7, 4, ...). - Gary W. Adamson, Apr 25 2008
Equals row sums of triangle A139633. - Gary W. Adamson, Apr 27 2008
E.g.f.: (3*(x+1)*exp(2*x) - x + 1)/4. - Amiram Eldar, Feb 19 2026
MATHEMATICA
CoefficientList[Series[(1-2x+2x^2-x^3)/(1-2x)^2, {x, 0, 50}], x] (* Harvey P. Dale, Mar 30 2011 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Jun 12 2003
STATUS
approved
