Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060766
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060766 Least common multiple of differences between consecutive divisors of n (ordered by size). +0
4
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; listen)
OFFSET

2,2

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])

CROSSREFS

Cf. A060680-A060682.

Sequence in context: A067240 A126080 A060681 this_sequence A029578 A054345 A060367

Adjacent sequences: A060763 A060764 A060765 this_sequence A060767 A060768 A060769

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 24 2001

EXTENSIONS

Edited by Dean Hickerson (dean(AT)math.ucdavis.edu), Jan 22 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 6 00:03 EDT 2008. Contains 143485 sequences.


AT&T Labs Research