A091821 - OEIS

A091821

a(n) counts the one-bits in the binary representation of n when we cycle from left to right through the individual bits of n, restarting at the leftmost bit after the rightmost is reached and performing n bitwise steps in total.

%I #2 Feb 27 2009 03:00:00

%S 1,1,3,2,3,4,7,2,5,5,8,6,10,11,15,4,7,7,11,8,13,13,18,10,15,16,22,18,

%T 23,24,31,6,11,11,17,12,19,19,25,14,20,21,29,22,30,31,39,16,25,26,34,

%U 27,35,36,46,29,39,39,49,40,51,52,63,10

%N a(n) counts the one-bits in the binary representation of n when we cycle from left to right through the individual bits of n, restarting at the leftmost bit after the rightmost is reached and performing n bitwise steps in total.

%C This might be called the bcrrpsod or binary cyclic right rotating progressive sum of digits function.

%e a(9) = 5 because 9 = 1001 in binary and cycling from left to right through 9 steps all the bits of 1001 are visited twice but the first bit, which is visited three times. Counting all visited one-bits evaluates to 5.

%K easy,nonn

%O 1,3

%A Frank Schwellinger (nummer_eins(AT)web.de), Mar 08 2004