The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A366744 The sum of divisors of the least coreful infinitary divisor of n. 3
1, 3, 4, 7, 6, 12, 8, 3, 13, 18, 12, 28, 14, 24, 24, 31, 18, 39, 20, 42, 32, 36, 24, 12, 31, 42, 4, 56, 30, 72, 32, 3, 48, 54, 48, 91, 38, 60, 56, 18, 42, 96, 44, 84, 78, 72, 48, 124, 57, 93, 72, 98, 54, 12, 72, 24, 80, 90, 60, 168, 62, 96, 104, 7, 84, 144, 68 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The number of divisors of the least coreful infinitary divisor of n is A366742(n).
LINKS
FORMULA
a(n) = A000203(A365296(n)).
a(n) = A000203(n) if and only if n is in A138302.
Multiplicative with a(p^e) = (p^(A006519(e)+1) - 1)/(p - 1).
Sum_{k=1..n} a(k) ~ c * n^2, where c = (1/2) * Product_{p prime} (1 - p/(p^2-1) + Sum_{e>=1} 1/p^f(e)) = 0.696427154..., where f(k) = 2*k - A006519(k) = A339597(k-1).
MATHEMATICA
f[p_, e_] := (p^(2^IntegerExponent[e, 2]+1) - 1)/(p - 1); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
PROG
(PARI) a(n) = {my(f = factor(n)); prod(i = 1, #f~, (f[i, 1]^(2^valuation(f[i, 2], 2)+1) - 1)/(f[i, 1] -1 )); }
CROSSREFS
Sequence in context: A366148 A367171 A348946 * A073185 A284341 A073183
KEYWORD
nonn,easy,mult
AUTHOR
Amiram Eldar, Oct 19 2023
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 3 05:44 EDT 2024. Contains 373054 sequences. (Running on oeis4.)