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
Max Alekseyev, Table of n, a(n) for n = 1..7
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
KEYWORD
nice,nonn
AUTHOR
William Rex Marshall, Nov 06 2010
EXTENSIONS
Edited by Max Alekseyev, Oct 09 2022
STATUS
approved