This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A357765 #9 Oct 13 2022 12:52:03
%S A357765 1,2,12,2520,48348686786400,
%T A357765 10543141534556403817127800577537146514577188497111149855093902265479066128013109211427715400552367011213513440000
%N A357765 Smallest positive integer that can be represented as the sum of n of its (possibly equal) divisors in the maximum number of ways (=A002966(n)).
%H A357765 Max Alekseyev, <a href="/A357765/b357765.txt">Table of n, a(n) for n = 1..7</a>
%F A357765 a(n) = LCM of all denominators of Egyptian fractions enumerated by A002966(n).
%e A357765 a(3) = 12 since for n = 3 the tuples forming the solutions of 1 = 1/x_1 + 1/x_2 + 1/x_3 are (x_1, x_2, x_3) in {(2, 3, 6), (2, 4, 4), (3, 3, 3)}. All these terms combined have an lcm of 12. The ways to write 12 as a sum of 3 of its divisors are therefore 12 = 12/2 + 12/3 + 12/6 = 6 + 4 + 2. Similarily we have 12 = 6 + 3 + 3 and 12 = 4 + 4 + 4.
%Y A357765 Apparently coincides with A181700 for n >= 4.
%Y A357765 Cf. A002966, A006585.
%K A357765 nice,nonn
%O A357765 1,2
%A A357765 _David A. Corneth_ and _Max Alekseyev_, Oct 12 2022