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”).

A193529
Sum of odd divisors of sopf(n).
1
0, 1, 4, 1, 6, 6, 8, 1, 4, 8, 12, 6, 14, 13, 1, 1, 18, 6, 20, 8, 6, 14, 24, 6, 6, 24, 4, 13, 30, 6, 32, 1, 8, 20, 4, 6, 38, 32, 1, 8, 42, 4, 44, 14, 1, 31, 48, 6, 8, 8, 6, 24, 54, 6, 1, 13, 12, 32, 60, 6, 62, 48, 6, 1, 13, 1, 68, 20, 14, 8, 72, 6, 74, 56, 1
OFFSET
1,3
LINKS
FORMULA
a(n) = A000593(A008472(n)). - Amiram Eldar, May 18 2023
EXAMPLE
a(5) = 6 because sopf(5) = 5, and the sum of the 2 odd divisors of 5, {1, 5}, is 6.
MATHEMATICA
Table[Total[Select[Divisors[Plus@@First[Transpose[FactorInteger[n]]]], OddQ[#]&]], {n, 100}]
sopf[n_] := Total[FactorInteger[n][[;; , 1]]]; oddsigma[n_] := DivisorSigma[1, n/2^IntegerExponent[n, 2]]; a[1] = 0; a[n_] := oddsigma[sopf[n]]; Array[a, 100] (* Amiram Eldar, May 18 2023 *)
CROSSREFS
Cf. A000593, A008472 (sopf), A193523.
Sequence in context: A205325 A021100 A021028 * A214561 A066575 A070251
KEYWORD
nonn
AUTHOR
Michel Lagneau, Jul 29 2011
STATUS
approved