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 A355367 #15 Jun 23 2023 13:22:25
%S A355367 1,2,3,6,6,12,15,30,30,60,60,84,105,210,210,420,420,420,420,840,840,
%T A355367 1260,1260,2310,2310,4620,4620,5460,5460,9240,9240,13860,13860,16380,
%U A355367 16380,30030,27720,60060,32760,40040,60060,120120,60060,180180,120120,157080,120120,360360
%N A355367 Maximal LCM of six positive integers with sum n.
%H A355367 <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a>
%t A355367 Table[Max[LCM@@@IntegerPartitions[n,{6}]],{n,6,60}] (* _Harvey P. Dale_, Jun 23 2023 *)
%o A355367 (PARI) a(n) = { my (v=0); forpart(p=n, v=max(v, lcm(Vec(p))),, [6,6]); v } \\ _Rémy Sigrist_, Jul 01 2022
%Y A355367 Cf. A008881.
%Y A355367 Maximal LCM of k positive integers with sum n for k = 2..7: A129647 (k=2), A129648 (k=3), A129649 (k=4), A129650 (k=5), this sequence (k=6), A355403 (k=7).
%K A355367 nonn
%O A355367 6,2
%A A355367 _Wesley Ivan Hurt_, Jun 29 2022