|
1, 2, 1, 3, 2, 2, 1, 4, 3, 2, 2, 3, 3, 2, 2, 5, 2, 4, 2, 3, 1, 2, 2, 4, 5, 3, 2, 3, 4, 2, 1, 6, 2, 4, 2, 5, 3, 4, 3, 4, 3, 2, 3, 3, 4, 2, 2, 5, 4, 5, 2, 3, 4, 4, 2, 4, 2, 4, 4, 3, 5, 2, 3, 7, 3, 2, 2, 6, 2, 2, 2, 4, 3, 4, 5, 3, 2, 3, 2, 5, 5, 6, 3, 3, 4, 2, 4, 4, 4, 5, 3, 3, 1, 2, 4, 6, 3, 5, 4, 5, 4, 4, 3, 4, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(4) = 3 because the divisors of 4 add up to 7, a number which in binary is written as 3 ones.
|
|
MAPLE
|
seq(convert(convert(numtheory:-sigma(n), base, 2), `+`), n=1..100); # Robert Israel, Nov 07 2017
|
|
MATHEMATICA
|
Table[Plus@@IntegerDigits[DivisorSigma[1, n], 2], {n, 80}] (* Alonso del Arte, Dec 03 2010 *)
|
|
PROG
|
(PARI) a(n) = hammingweight(sigma(n)); \\ Michel Marcus, Feb 08 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|