login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A193526 Sum of even divisors of sopf(n). 1
0, 2, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 14, 2, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 0, 0, 12, 0, 2, 16, 0, 24, 0, 0, 0, 30, 0, 0, 24, 0, 0, 14, 0, 0, 0, 0, 0, 36, 0, 0, 0, 30, 0, 24, 0, 0, 12, 0, 0, 12, 2, 26, 30, 0, 0, 28, 16, 0, 0, 0, 0, 14, 0, 26, 26, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Sopf(n) is the sum of the distinct primes dividing n (A008472).
LINKS
FORMULA
a(1) = 0; for n > 1, a(n) = A146076(A008472(n))). - Antti Karttunen, Dec 23 2018
MATHEMATICA
Table[Total[Select[Divisors[Plus @@ First[Transpose[FactorInteger[n]]]], EvenQ[#] &]], {n, 100}]
PROG
(PARI)
A008472(n) = vecsum(factor(n)[, 1]); \\ From A008472
A146076(n) = if (n%2, 0, 2*sigma(n/2)); \\ From A146076
A193526(n) = if(1==n, 0, A146076(A008472(n))); \\ Antti Karttunen, Dec 23 2018
CROSSREFS
Sequence in context: A359893 A218855 A069517 * A160498 A089800 A079208
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)