| 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 2, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 1, 2, 1, 1, 0, 1, 1, 1, 1, 2, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 1, 2, 1, 1, 1, 2, 2, 2, 2, 3, 2, 2, 1, 2, 2, 2, 1, 2, 1, 1, 0, 1, 1, 1, 1, 2, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,22
|
|
|
COMMENT
|
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.
|
|
LINKS
|
R. Stephan, Some divide-and-conquer sequences ...
R. Stephan, Table of generating functions
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Index entries for sequences related to binary expansion of n
|
|
FORMULA
|
a(2n) = a(n), a(2n+1) = a(n) + [n is even]. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Aug 21 2003
G.f.: 1/(1-x) * sum(k>=0, t^5/(1+t)/(1+t^2), t=x^2^k). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 10 2003
a(n) = A069010(n) - 1, n>0. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 10 2003
|
|
CROSSREFS
|
Cf. A014081, A014082, A033264, A037800, A056974, A056975, A056976, A056977, A056978, A056979, A056980.
Sequence in context: A076453 A005590 A142598 this_sequence A144411 A138253 A085737
Adjacent sequences: A037797 A037798 A037799 this_sequence A037801 A037802 A037803
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
