OFFSET
1,2
COMMENTS
For all the positive numbers m obtained from n by flipping one bit of the binary representation of n, add the number of divisors A000005(m) of m.
Number of ordered pairs (a,b) of positive numbers such that a*b differs from n in exactly one binary digit, with no more binary digits than n.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
MAPLE
f:= proc(x)
local m;
add(numtheory:-tau(m), m=[seq(Bits:-Xor(x, 2^j), j=0..ilog2(x))])
end proc:
map(f, [$1..100]);
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert Israel, Apr 12 2016
STATUS
approved