The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A181700 Smallest positive integer that can be represented as the sum of n of its distinct divisors in the maximum number of ways, or a(n)=0 if no such number exists. 2
1, 0, 6, 2520, 48348686786400, 10543141534556403817127800577537146514577188497111149855093902265479066128013109211427715400552367011213513440000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
A006585(n) gives the number of representations of a(n) as the sum of n of its distinct divisors.
For n >= 4, a(n) appears to coincide with A357765(n). - Max Alekseyev, Oct 09 2022
LINKS
FORMULA
For n >= 3, a(n) = LCM of all denominators of Egyptian fractions enumerated by A006585(n). - Max Alekseyev, Oct 12 2022
EXAMPLE
For n=4, a(4)=2520 has the six solutions: 60+360+840+1260, 105+315+840+1260, 126+504+630+1260, 140+280+840+1260, 168+252+840+1260, 210+420+630+1260.
CROSSREFS
Sequence in context: A069643 A264801 A067630 * A199147 A097871 A210004
KEYWORD
nice,nonn
AUTHOR
EXTENSIONS
Edited by Max Alekseyev, Oct 09 2022
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 June 16 19:52 EDT 2024. Contains 373432 sequences. (Running on oeis4.)