|
Search: id:A103185
|
|
|
| A103185 |
|
a(n) = Sum_{ k >= 0 such that n + k == 0 mod 2^k } 2^(k-1). |
|
+0
6
|
|
| 0, 1, 2, 1, 0, 5, 2, 1, 0, 1, 2, 1, 8, 5, 2, 1, 0, 1, 2, 1, 0, 5, 2, 1, 0, 1, 2, 17, 8, 5, 2, 1, 0, 1, 2, 1, 0, 5, 2, 1, 0, 1, 2, 1, 8, 5, 2, 1, 0, 1, 2, 1, 0, 5, 2, 1, 0, 1, 34, 17, 8, 5, 2, 1, 0, 1, 2, 1, 0, 5, 2, 1, 0, 1, 2, 1, 8, 5, 2, 1, 0, 1, 2, 1, 0, 5, 2, 1, 0, 1, 2, 17, 8, 5, 2, 1, 0, 1, 2, 1, 0, 5, 2, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
David Applegate, Benoit Cloitre, Philippe DELEHAM and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers, J. Integer Seq. 8 (2005), no. 3, Article 05.3.6, 15 pp.
|
|
LINKS
|
David Applegate, Benoit Cloitre, Philippe DELEHAM and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers [pdf, ps].
|
|
MATHEMATICA
|
f[n_] := Block[{k = 1, s = 0, l = Max[2, Floor[ Log[2, n + 1] + 2]]}, While[k < l, If[ Mod[n + k, 2^k] == 0, s = s + 2^(k - 1)]; k++ ]; s]; Table[ f[n], {n, 0, 103}] (from Robert G. Wilson v Mar 18 2005)
|
|
PROGRAM
|
(PARI) A103185(n)=(sum(k=0, ceil(log(n+1)/log(2)), if((n+k)%2^k, 0, 2^k))-1)/2 (Benoit Cloitre, Mar 20 2005)
|
|
CROSSREFS
|
Equals (A102370(n)-n)/2.
Sequence in context: A060137 A143445 A133727 this_sequence A130513 A114596 A083417
Adjacent sequences: A103182 A103183 A103184 this_sequence A103186 A103187 A103188
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mar 18 2005
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Mar 18 2005
|
|
|
Search completed in 0.002 seconds
|
