| 4, 8, 9, 16, 17, 18, 19, 32, 33, 34, 35, 36, 37, 38, 39, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153
(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 + 3[n==0].
a(n) = n + 3 * 2^floor(log2(n)) = A004755(n) + A053644(n).
|
|
EXAMPLE
|
18 in binary is 10010, so 18 is in sequence.
|
|
PROGRAM
|
(PARI) a(n)=n+3*2^floor(log(n)/log(2))
|
|
CROSSREFS
|
Cf. A004754 (10), A004755 (11), A004757 (101), A004758 (110), A004759 (111).
Cf. A004760, A053644, A062050, A076877.
Sequence in context: A141066 A018196 A072103 this_sequence A153034 A106840 A140612
Adjacent sequences: A004753 A004754 A004755 this_sequence A004757 A004758 A004759
|
|
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
|
|
