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!)
A324505 a(n) = numerator of Sum_{d|n} (d/pod(d)) where pod(k) = the product of the divisors of k (A007955). 0
1, 2, 2, 5, 2, 19, 2, 21, 7, 31, 2, 529, 2, 43, 46, 169, 2, 1135, 2, 1441, 64, 67, 2, 52513, 11, 79, 64, 2801, 2, 117001, 2, 2705, 100, 103, 106, 1122553, 2, 115, 118, 238561, 2, 317521, 2, 6865, 6886, 139, 2, 20247937, 15, 8251, 154, 9569, 2, 557443, 166 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Sum_{d|n} (d/pod(d)) >= 1 for all n >= 1.
Sum_{d|n} (d/pod(d)) = 2 iff n = primes (A000040).
LINKS
FORMULA
a(p) = 2 for p = primes.
EXAMPLE
Sum_{d|n} (d/pod(d)) for n >= 1: 1, 2, 2, 5/2, 2, 19/6, 2, 21/8, 7/3, 31/10, 2, 529/144, 2, 43/14, 46/15, 169/64, ...
For n=4; Sum_{d|4} (d/pod(d)) = 1/pod(1) + 2/pod(2) + 4/pod(4) = 1/1 + 2/2 + 4/8 = 5/2; a(4) = 5.
MATHEMATICA
Table[Numerator[Sum[k/Product[j, {j, Divisors[k]}], {k, Divisors[n]}]], {n, 1, 60}] (* G. C. Greubel, Mar 04 2019 *)
PROG
(Magma) [Numerator(&+[d / &*[c: c in Divisors(d)]: d in Divisors(n)]): n in [1..100]]
(Sage) [sum(k/product(j for j in k.divisors()) for k in n.divisors()).numerator() for n in (1..60)] # G. C. Greubel, Mar 04 2019
CROSSREFS
Cf. A000040, A007955, A007956 (denominators).
Sequence in context: A085483 A271654 A271622 * A226135 A284464 A038041
KEYWORD
nonn,frac
AUTHOR
Jaroslav Krizek, Mar 03 2019
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 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)