login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A193349
Sum of odd divisors of tau(n).
2
1, 1, 1, 4, 1, 1, 1, 1, 4, 1, 1, 4, 1, 1, 1, 6, 1, 4, 1, 4, 1, 1, 1, 1, 4, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 13, 1, 1, 1, 1, 1, 1, 1, 4, 4, 1, 1, 6, 4, 4, 1, 4, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 4, 8, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 4, 4, 1, 1, 1, 6, 6, 1, 1, 4, 1, 1
OFFSET
1,4
LINKS
FORMULA
a(n) = A000593(A000005(n)). - Reinhard Zumkeller, Jul 25 2011
From Amiram Eldar, Aug 12 2024: (Start)
a(n) = 1 if and only if n is in A036537.
a(n) = A062069(n) if and only if n is a square. (End)
EXAMPLE
a(36) = 13 because tau(36) = 9 and the sum of the 3 odd divisors {1, 3, 9} is 13.
MATHEMATICA
Table[Total[Select[Divisors[DivisorSigma[0, n]], OddQ[ # ]&]], {n, 80}]
PROG
(PARI) a(n)=sumdiv(sigma(n, 0), d, (d%2)*d);
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Lagneau, Jul 23 2011
STATUS
approved