|
%I #9 Oct 12 2022 10:59:12
%S 1,0,6,2520,48348686786400,
%T 10543141534556403817127800577537146514577188497111149855093902265479066128013109211427715400552367011213513440000
%N 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.
%C A006585(n) gives the number of representations of a(n) as the sum of n of its distinct divisors.
%C For n >= 4, a(n) appears to coincide with A357765(n). - _Max Alekseyev_, Oct 09 2022
%H Max Alekseyev, <a href="/A181700/b181700.txt">Table of n, a(n) for n = 1..7</a>
%F For n >= 3, a(n) = LCM of all denominators of Egyptian fractions enumerated by A006585(n). - _Max Alekseyev_, Oct 12 2022
%e 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.
%Y Cf. A002966, A006585, A357765.
%K nice,nonn
%O 1,3
%A _William Rex Marshall_, Nov 06 2010
%E Edited by _Max Alekseyev_, Oct 09 2022
| 