OFFSET
1,2
COMMENTS
See A186643 for a definition of which divisors of n are classified as oex divisors.
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..16384
FORMULA
a(n) >= A049417(n).
MAPLE
maxval := proc(n, d) local nshf, a ; if n mod d <> 0 then 0; else nshf := n ; a := 0 ; while nshf mod d = 0 do nshf := nshf /d ; a := a+1 ; end do: a; end if; end proc:
A186644 := proc(n) a := 1 ; for d in numtheory[divisors](n) minus {1} do if type(maxval(n, d), 'odd') then a := a+d ; end if; end do: a ; end proc: # R. J. Mathar, Mar 04 2011
MATHEMATICA
Table[DivisorSum[n, # &, Or[# == 1, OddQ@ IntegerExponent[n, #]] &], {n, 77}] (* Michael De Vlieger, Nov 23 2017 *)
PROG
(PARI) a(n) = sumdiv(n, d, d*((d==1) || (valuation(n, d) % 2))); \\ Michel Marcus, Feb 06 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Feb 25 2011
EXTENSIONS
More terms from Antti Karttunen, Nov 23 2017
STATUS
approved