This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A274940 Let p^e be the largest prime power appearing in the factorization of sigma(n)/n into prime powers, where sigma = A000203. If p^e appears in the numerator of S(n)/n then a(n) = n*p, otherwise a(n) = n/p. Set a(1)=1. 3
 1, 6, 6, 28, 1, 12, 14, 4, 117, 30, 1, 84, 1, 2, 30, 496, 1, 234, 1, 140, 42, 2, 1, 120, 775, 2, 9, 56, 1, 6, 62, 16, 66, 102, 70, 468, 1, 2, 3, 120, 1, 84, 1, 4, 585, 2, 1, 1488, 7, 1550, 3, 364, 1, 18, 5, 8, 3, 2, 1, 420, 1, 2, 819, 8128, 5, 6, 1, 4, 138, 210, 1, 936, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 REFERENCES Allan C. Wechsler, Posting to Math Fun Mailing List, July 16 2016. LINKS Michael De Vlieger, Table of n, a(n) for n = 1..10000 EXAMPLE a(3) = 6 because sigma(3)/3 = 4/3; prime power factors are {2^2, 3^-1}; 2^2 is larger in magnitude thus p = 2 so 3 * 2 = 6. a(4) = 28 because sigma(4)/4= 7/4; prime power factors are {2^2, 7^1}; 7 is larger in magnitude thus p = 7 so 4 * 7 = 28. - Michael De Vlieger, Jul 20 2016 MATHEMATICA Table[n #1^Sign[#2] & @@ Last@ FactorInteger@ First@ MaximalBy[#, Abs@ Log@ # &] &@ Map[#1^#2 & @@ # &, FactorInteger@ #] &[DivisorSigma[1, n]/n], {n, 74}] (* Michael De Vlieger, Jul 20 2016 *) PROG (PARI) a(n) = if (n==1, 1, f = factor(sigma(n)/n); vf = vector(#f~, k, k); vsi = vecsort(vf, cmpf, 1); imax = vsi[#f~]; if (f[imax, 2] > 0, n*f[imax, 1], n/f[imax, 1])); \\ Michel Marcus, Jul 20 2016 CROSSREFS Cf. A000203, A274939, A274941. Sequence in context: A123874 A241865 A243122 * A253066 A016725 A267651 Adjacent sequences:  A274937 A274938 A274939 * A274941 A274942 A274943 KEYWORD nonn AUTHOR N. J. A. Sloane, Jul 20 2016 EXTENSIONS More terms from Michel Marcus, Jul 20 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 18 15:00 EDT 2019. Contains 326106 sequences. (Running on oeis4.)