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!)
A083538 a(n) = sigma(n)*sigma(n+1)/gcd(sigma(n+1), sigma(n))^2. 17
3, 12, 28, 42, 2, 6, 120, 195, 234, 6, 21, 2, 84, 1, 744, 558, 78, 780, 210, 336, 72, 6, 10, 1860, 1302, 420, 35, 420, 60, 36, 2016, 336, 72, 72, 4368, 3458, 570, 210, 1260, 105, 112, 264, 231, 182, 156, 6, 372, 7068, 589, 744, 1764, 1323, 180, 15, 15, 6, 72, 6, 70 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n) = A060781(n)/A060780(n) = A083539(n)/A060780(n)^2; quotient when lcm(sigma(n+1), sigma(n)) is divided by gcd(sigma(n+1), sigma(n)).
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
EXAMPLE
n=10: sigma(10)=18, sigma(11)=12, lcm(18, 12)=36, gcd(18, 12)=6, a(10) = 36/6 = 6.
MATHEMATICA
f[x_] := DivisorSigma[1, x] t=Table[LCM[f[w+1], f[w]]/GCD[f[w+1], f[w]], {w, 1, 128}]
Times@@#/(GCD@@#)^2&/@Partition[DivisorSigma[1, Range[60]], 2, 1] (* Harvey P. Dale, Feb 17 2016 *)
PROG
(PARI) a(n)=my(x=sigma(n), y=sigma(n+1)); x*y/gcd(x, y)^2 \\ Charles R Greathouse IV, Mar 09 2014
CROSSREFS
Sequence in context: A009222 A260815 A083543 * A060781 A083539 A237426
KEYWORD
nonn
AUTHOR
Labos Elemer, May 21 2003
EXTENSIONS
Edited by N. J. A. Sloane, Apr 29 2007
Corrections by Charles R Greathouse IV, Mar 09 2014
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 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)