login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A193529 Sum of odd divisors of sopf(n). 0
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Sopf(n) is the sum of the distinct primes dividing n (A008472).

LINKS

Table of n, a(n) for n=1..75.

EXAMPLE

a(5) = 6 because sopf(5) = 5, and the sum of the 2 odd divisors { 1, 5} is 6.

MATHEMATICA

Table[Total[Select[Divisors[Plus@@First[Transpose[FactorInteger[n]]]], OddQ[#]&]], {n, 100}]

CROSSREFS

Cf. A008472 A193523.

Sequence in context: A205325 A021100 A021028 * A214561 A066575 A070251

Adjacent sequences:  A193526 A193527 A193528 * A193530 A193531 A193532

KEYWORD

nonn

AUTHOR

Michel Lagneau, Jul 29 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 19 05:18 EDT 2021. Contains 345125 sequences. (Running on oeis4.)