|
Search: id:A103528
|
|
|
| A103528 |
|
Sum_{k = 1..n-1 such that n == k mod 2^k} 2^(k-1). |
|
+0
4
|
|
| 0, 0, 1, 0, 1, 2, 1, 0, 1, 2, 5, 0, 1, 2, 1, 0, 1, 2, 5, 8, 1, 2, 1, 0, 1, 2, 5, 0, 1, 2, 1, 0, 1, 2, 5, 8, 17, 2, 1, 0, 1, 2, 5, 0, 1, 2, 1, 0, 1, 2, 5, 8, 1, 2, 1, 0, 1, 2, 5, 0, 1, 2, 1, 0, 1, 2, 5, 8, 17, 34, 1, 0, 1, 2, 5, 0, 1, 2, 1, 0, 1, 2, 5, 8, 1, 2, 1, 0, 1, 2, 5, 0, 1, 2, 1, 0, 1, 2, 5, 8
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
COMMENT
|
Is there a simpler closed form?
|
|
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].
|
|
FORMULA
|
a(n) = (A102371(n) + n)/2 - 2^(n-1). - Philippe DELEHAM, Mar 27 2005
|
|
MAPLE
|
f:=proc(n) local t1, k; t1:=0; for k from 1 to n-1 do if n mod 2^k = k then t1:=t1+2^(k-1); fi; od: t1; end;
|
|
CROSSREFS
|
Sequence in context: A136868 A145895 A114503 this_sequence A138352 A129620 A074766
Adjacent sequences: A103525 A103526 A103527 this_sequence A103529 A103530 A103531
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mar 22 2005
|
|
|
Search completed in 0.002 seconds
|
