OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = (Ea-1)*(Eb-1)*(Ec-1)* ...*(Oa+1)*(Ob+1)*(Oc+1)..., where Ea, Eb, Ec, ... and Oa, Ob, Oc, ... are respectively the even and odd divisors of n.
a(p) = 2(p+1), a(p^r) = (p^r +1)*a(p^(r-1)) where p is an odd prime.
EXAMPLE
a(14) = 208. The divisors of 14 are 1,2,7 and 14 and the corresponding numbers obtained are 2,1,8 and 13 whose product is 208.
MAPLE
f:= proc(n) local d;
mul(`if`(d::odd, d+1, d-1), d=numtheory:-divisors(n))
end proc:
map(f, [$1..100]); # Robert Israel, Dec 25 2024
MATHEMATICA
Table[Times@@(If[OddQ[#], #+1, #-1]&/@Divisors[n]), {n, 50}] (* Harvey P. Dale, Sep 25 2022 *)
PROG
(PARI) a(n) = local(d); d = divisors(n); for (i = 1, length(d), if (d[i]%2, d[i]++, d[i]--)); prod(i = 1, length(d), d[i]); \\ David Wasserman, Mar 15 2005
CROSSREFS
KEYWORD
AUTHOR
Amarnath Murthy, Aug 18 2003
EXTENSIONS
More terms from David Wasserman, Mar 15 2005
STATUS
approved
