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!)
A060766 Least common multiple of differences between consecutive divisors of n (ordered by size). 5
1, 2, 2, 4, 3, 6, 4, 6, 15, 10, 6, 12, 35, 10, 8, 16, 9, 18, 10, 28, 99, 22, 12, 20, 143, 18, 42, 28, 60, 30, 16, 88, 255, 28, 18, 36, 323, 130, 60, 40, 21, 42, 154, 60, 483, 46, 24, 42, 75, 238, 234, 52, 27, 132, 84, 304, 783, 58, 60, 60, 899, 84, 32, 104, 165, 66, 442 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,2
LINKS
FORMULA
a(n) = A290103(A328023(n)). - Gus Wiseman, Oct 16 2019
EXAMPLE
For n=98, divisors={1,2,7,14,49,98}; differences={1,5,7,35,49}; a(98) = LCM of differences = 245.
MATHEMATICA
a[n_ ] := LCM@@(Drop[d=Divisors[n], 1]-Drop[d, -1])
Table[LCM@@Differences[Divisors[n]], {n, 2, 70}] (* Harvey P. Dale, Oct 08 2012 *)
CROSSREFS
The GCD version appears to be A258409.
The LCM of the prime indices of n is A290103(n).
The differences between consecutive divisors of n are row n of A193829.
Sequence in context: A202479 A161660 A343327 * A321015 A365195 A365433
KEYWORD
nonn
AUTHOR
Labos Elemer, Apr 24 2001
EXTENSIONS
Edited by Dean Hickerson, Jan 22 2002
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 19 16:38 EDT 2024. Contains 371794 sequences. (Running on oeis4.)