| 2, 4, 5, 8, 9, 10, 11, 16, 17, 18, 19, 20, 21, 22, 23, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 128, 129, 130, 131
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
R. Stephan, Some divide-and-conquer sequences ...
R. Stephan, Table of generating functions
|
|
FORMULA
|
a(2n) = 2a(n), a(2n+1) = 2a(n) + 1 + [n==0].
a(n) = n + 2^floor(log2(n)) = n + A053644(n).
|
|
EXAMPLE
|
10 in binary is 1010, so 10 is in sequence.
|
|
PROGRAM
|
(PARI) a(n)=n+2^floor(log(n)/log(2))
|
|
CROSSREFS
|
Cf. A004755 (11), A004756 (100), A004757 (101), A004758 (110), A004759 (111).
Cf. A004760, A053644, A062050, A076877.
Apart from initial terms, same as A004761.
Sequence in context: A072008 A072756 A004761 this_sequence A010450 A035231 A035259
Adjacent sequences: A004751 A004752 A004753 this_sequence A004755 A004756 A004757
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Edited by Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 12 2003
|
|
