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!)
A373058 The sum of the aliquot coreful divisors of the nonsquarefree numbers. 1
2, 6, 3, 6, 14, 6, 10, 18, 5, 12, 14, 30, 36, 30, 22, 15, 42, 7, 10, 26, 24, 42, 30, 21, 62, 34, 96, 15, 38, 70, 39, 42, 66, 30, 46, 90, 14, 33, 80, 78, 126, 98, 58, 39, 90, 11, 62, 30, 42, 126, 66, 60, 102, 70, 216, 21, 74, 30, 114, 51, 78, 150, 78, 82, 126, 13 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A coreful divisor d of n is a divisor that is divisible by every prime that divides n (see also A307958).
The positive terms of A336563: if k is a squarefree number (A005117) then the only coreful divisor of k is k itself, so k has no aliquot coreful divisors.
The number of the aliquot coreful divisors of the n-th nonsquarefree number is A368039(n).
LINKS
FORMULA
a(n) = A336563(A013929(n)).
Sum_{k=1..n} a(k) ~ c * n^2 / 2, where c = (A065487 - 1)/(1-1/zeta(2))^2 = 1.50461493205911656114... .
MATHEMATICA
f[p_, e_] := (p^(e + 1) - 1)/(p - 1) - 1; s[1] = 0; s[n_] := Times @@ f @@@ FactorInteger[n] - n; Select[Array[s, 300], # > 0 &]
PROG
(PARI) lista(kmax) = {my(f); for(k = 1, kmax, f = factor(k); if(!issquarefree(f), print1(prod(i = 1, #f~, (f[i, 1]^(f[i, 2]+1) - 1)/(f[i, 1] - 1) - 1) - k, ", "))); }
CROSSREFS
Sequence in context: A280342 A275476 A185380 * A136695 A337115 A354372
KEYWORD
nonn,easy
AUTHOR
Amiram Eldar, May 21 2024
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 June 22 23:11 EDT 2024. Contains 373629 sequences. (Running on oeis4.)