OFFSET
1,3
COMMENTS
A run is a maximal subsequence of (possibly just one) identical bits.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Aruna Gabhe, Problem 11623, Am. Math. Monthly 119 (2012) 161.
Index entries for linear recurrences with constant coefficients, signature (2,2,-4).
FORMULA
a(n) = 2^n - 2^(floor(n/2)+1).
a(n) = 2*a(n-1) + 2*a(n-2) - 4*a(n-3), a(0) = 0, a(1) = 0, a(2) = 4.
G.f.: 4*x^2/((1 - 2*x)*(1 - 2*x^2)).
E.g.f.: 2*(cosh(2*x) - cosh(sqrt(2)*x) + sinh(2*x) - sqrt(2)*sinh(sqrt(2)*x)). - Stefano Spezia, Jun 06 2023
EXAMPLE
If n=3 the bitstrings (with at least two runs) where the last runs have different lengths are 100,011,110,001 so a(3) = 4.
MATHEMATICA
Table[2^n - 2^(Floor[ n/2] + 1) , {n, 1, 40}]
LinearRecurrence[{2, 2, -4}, {0, 0, 4}, 40]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
David Nacin, Mar 03 2012
STATUS
approved