

A209859


Rewrite the binary expansion of n from the most significant end, 1 > 1, 0+1 (one or more zeros followed by one) > 0, drop the trailing zeros of the original n.


4



0, 1, 1, 3, 1, 2, 3, 7, 1, 2, 2, 5, 3, 6, 7, 15, 1, 2, 2, 5, 2, 4, 5, 11, 3, 6, 6, 13, 7, 14, 15, 31, 1, 2, 2, 5, 2, 4, 5, 11, 2, 4, 4, 9, 5, 10, 11, 23, 3, 6, 6, 13, 6, 12, 13, 27, 7, 14, 14, 29, 15, 30, 31, 63, 1, 2, 2, 5, 2, 4, 5, 11, 2, 4, 4, 9, 5, 10, 11, 23, 2, 4, 4, 9, 4, 8, 9, 19, 5, 10, 10, 21, 11, 22, 23, 47, 3, 6, 6, 13, 6, 12, 13, 27, 6, 12, 12, 25, 13
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,4


COMMENTS

a(n) = a(A000265(n)).


LINKS

Table of n, a(n) for n=0..108.


EXAMPLE

102 in binary is 1100110, we rewrite it from the left so that first two 1's stay same ("11"), then "001" is rewritten to ""0, the last 1 to "1", and we ignore the last 0, thus getting 1101, which is binary expansion of 13, thus a(102) = 13.


PROG

(Scheme): (define (A209859 n) (let loop ((n n) (s 0) (i (A053644 n))) (cond ((zero? n) s) ((> i n) (if (> (/ i 2) n) (loop n s (/ i 2)) (loop ( n (/ i 2)) (* 2 s) (/ i 4)))) (else (loop ( n i) (+ (* 2 s) 1) (/ i 2))))))


CROSSREFS

This is an "inverse" of A071162, i.e. a(A071162(n)) = n for all n. Bisection: A209639. Used to construct permutation A209862.
Sequence in context: A060477 A345037 A175945 * A262218 A331695 A245538
Adjacent sequences: A209856 A209857 A209858 * A209860 A209861 A209862


KEYWORD

nonn,base


AUTHOR

Antti Karttunen, Mar 24 2012


STATUS

approved



