|
Search: id:A105023
|
|
| |
|
| 0, 2, 4, 2, 0, 10, 4, 2, 0, 2, 4, 2, 16, 10, 4, 2, 0, 2, 4, 2, 0, 10, 4, 2, 0, 2, 4, 34, 16, 10, 4, 2, 0, 2, 4, 2, 0, 10, 4, 2, 0, 2, 4, 2, 16, 10, 4, 2, 0, 2, 4, 2, 0, 10, 4, 2, 0, 2, 68, 34, 16, 10, 4, 2, 0, 2, 4, 2, 0, 10, 4, 2, 0, 2, 4, 2, 16, 10, 4, 2, 0, 2, 4, 2, 0, 10, 4, 2, 0, 2, 4, 34, 16, 10, 4
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
When written in base 2 as a right justified table, columns have periods 1, 2, 4, 8, ... - Philippe DELEHAM, Apr 21 2005
|
|
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) = Sum_{ k >= 1 such that n + k == 0 mod 2^k } 2^k.
|
|
EXAMPLE
|
Has a natural decomposition into blocks: 0; 2; 4, 2, 0; 10, 4, 2, 0, 2, 4, 2; 16, 10, 4, 2, 0, 2, 4, 2, 0, 10, 4, 2, 0, 2, 4; 34, 16, 10, 4, ... where the leading term in each block is given by A105024.
|
|
MAPLE
|
s:= proc (n) local t1, l; t1 := 0; for l to n do if `mod`(n+l, 2^l) = 0 then t1 := t1+2^l end if end do; t1 end proc;
|
|
CROSSREFS
|
Cf. A102370, A103185, A105024.
Sequence in context: A058672 A127278 A094239 this_sequence A052285 A046858 A132823
Adjacent sequences: A105020 A105021 A105022 this_sequence A105024 A105025 A105026
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Apr 03 2005
|
|
|
Search completed in 0.002 seconds
|
