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”).
reviewed
approved
proposed
reviewed
editing
proposed
Ralf Stephan, <a href="/somedcgf.html">Some divide-and-conquer sequences ...with (relatively) simple ordinary generating functions</a>, 2004.
Ralf Stephan, <a href="/A079944/a079944.ps">Table of generating functions</a>.
Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/DigitBlock.html">Digit Block</a>.
Jean-Paul Allouche and Jeffrey Shallit, <a href="https://doi.org/10.1007/BFb0097122">Sums of digits and the Hurwitz zeta function</a>, in: K. Nagasaka and E. Fouvry (eds.), Analytic Number Theory, Lecture Notes in Mathematics, Vol. 1434, Springer, Berlin, Heidelberg, 1990, pp. 19-30.
Sum_{n>=1} a(n)/(n*(n+1)) = Pi/4 - log(2)/2 (A196521) (Allouche and Shallit, 1990). - Amiram Eldar, Jun 01 2021
approved
editing
editing
approved
Number of i such that d(i) < d(i-1), where Sum_{d(i)*2^i: i=0,1,....,m} is base 2 representation of n.
G.f.: 1/(1-x) * sumSum_(k>=0, t^2/(1+t)/(1+t^2), t=x^2^k). - Ralf Stephan, Sep 10 2003
a(n) = A087116(n) for n > 0 , since strings of 0s 0's alternate with strings of 1s, 1's, which end in (1,0). - Jonathan Sondow, Jan 17 2016
approved
editing
proposed
approved
editing
proposed
This is the base-2 down-variation sequence; see A297330. - Clark Kimberling, Jan 18 2017
approved
editing