A230877 - OEIS

A230877

If n = Sum_{i=0..m} c(i)*2^i, c(i) = 0 or 1, then a(n) = Sum_{i=0..m} (m+1-i)*c(i).

0, 1, 1, 3, 1, 4, 3, 6, 1, 5, 4, 8, 3, 7, 6, 10, 1, 6, 5, 10, 4, 9, 8, 13, 3, 8, 7, 12, 6, 11, 10, 15, 1, 7, 6, 12, 5, 11, 10, 16, 4, 10, 9, 15, 8, 14, 13, 19, 3, 9, 8, 14, 7, 13, 12, 18, 6, 12, 11, 17, 10, 16, 15, 21, 1, 8, 7, 14, 6, 13, 12, 19, 5, 12, 11, 18, 10, 17, 16, 23, 4, 11, 10, 17, 9, 16, 15, 22, 8, 15, 14

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,4

COMMENTS

Suggested by Jon Perry's A231204, only now the leading power of 2 gets weight 1.

LINKS

Rémy Sigrist, Table of n, a(n) for n = 0..8192

EXAMPLE

For n=13 we have 1101, so we add 1+2+4, getting a(13)=7.

MAPLE

f:=proc(n) local t1, m, i;

t1:=convert(n, base, 2);