OFFSET
1,3
COMMENTS
This might be called the bcrrpsod or binary cyclic right rotating progressive sum of digits function.
EXAMPLE
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.
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Frank Schwellinger (nummer_eins(AT)web.de), Mar 08 2004
STATUS
approved