|
| |
|
|
A037809
|
|
Number of i such that d(i)>=d(i-1), where Sum{d(i)*2^i: i=0,1,...,m} is the base 2 representation of n.
|
|
0
| |
|
|
0, 0, 1, 1, 1, 1, 2, 2, 2, 1, 2, 2, 2, 2, 3, 3, 3, 2, 3, 2, 2, 2, 3, 3, 3, 2, 3, 3, 3, 3, 4, 4, 4, 3, 4, 3, 3, 3, 4, 3, 3, 2, 3, 3, 3, 3, 4, 4, 4, 3, 4, 3, 3, 3, 4, 4, 4, 3, 4, 4, 4, 4, 5, 5, 5, 4, 5, 4, 4, 4, 5, 4, 4, 3, 4, 4, 4, 4, 5, 4, 4, 3, 4, 3, 3, 3, 4, 4, 4, 3
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,7
|
|
|
LINKS
| R. Stephan, Some divide-and-conquer sequences ...
R. Stephan, Table of generating functions
|
|
|
FORMULA
| G.f. -1/(1-x) + 1/(1-x) * sum(k>=0, (t+t^3+t^4)/(1+t+t^2+t^3), t=x^2^k). a(n) = A056973(n) + A000120(n) - 1. a(n) = b(n)-1, with b(0)=0, b(2n)=b(n)+[n even], b(2n+1)=b(n)+1. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 05 2003
|
|
|
CROSSREFS
| Sequence in context: A032539 A122922 A046799 * A097195 A129451 A179301
Adjacent sequences: A037806 A037807 A037808 * A037810 A037811 A037812
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu)
|
| |
|
|
