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!)
A332883 If n = Product (p_j^k_j) then a(n) = denominator of Product (1 + 1/p_j^k_j). 3
1, 2, 3, 4, 5, 1, 7, 8, 9, 5, 11, 3, 13, 7, 5, 16, 17, 3, 19, 2, 21, 11, 23, 2, 25, 13, 27, 7, 29, 5, 31, 32, 11, 17, 35, 18, 37, 19, 39, 20, 41, 7, 43, 11, 3, 23, 47, 12, 49, 25, 17, 26, 53, 9, 55, 7, 57, 29, 59, 1, 61, 31, 63, 64, 65, 11, 67, 34, 23, 35 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Denominator of sum of reciprocals of unitary divisors of n.
LINKS
Eric Weisstein's World of Mathematics, Unitary Divisor
FORMULA
a(n) = denominator of Sum_{d|n, gcd(d, n/d) = 1} 1/d.
a(n) = denominator of usigma(n)/n.
a(p) = p, where p is prime.
a(n) = n / A323166(n). - Antti Karttunen, Nov 13 2021
EXAMPLE
1, 3/2, 4/3, 5/4, 6/5, 2, 8/7, 9/8, 10/9, 9/5, 12/11, 5/3, 14/13, 12/7, 8/5, 17/16, ...
MAPLE
a:= n-> denom(mul(1+i[1]^i[2], i=ifactors(n)[2])/n):
seq(a(n), n=1..80); # Alois P. Heinz, Feb 28 2020
MATHEMATICA
Table[If[n == 1, 1, Times @@ (1 + 1/#[[1]]^#[[2]] & /@ FactorInteger[n])], {n, 1, 70}] // Denominator
Table[Sum[If[GCD[d, n/d] == 1, 1/d, 0], {d, Divisors[n]}], {n, 1, 70}] // Denominator
PROG
(PARI) a(n) = denominator(sumdiv(n, d, if (gcd(d, n/d)==1, 1/d))); \\ Michel Marcus, Feb 28 2020
CROSSREFS
Cf. A007947, A017666, A034448, A077610, A319677, A323166, A327158 (positions of 1's), A332881, A332882 (numerators).
Sequence in context: A100994 A140523 A237517 * A017666 A253247 A201059
KEYWORD
nonn,frac
AUTHOR
Ilya Gutkovskiy, Feb 28 2020
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 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)