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