login
A355367
Maximal LCM of six positive integers with sum n.
6
1, 2, 3, 6, 6, 12, 15, 30, 30, 60, 60, 84, 105, 210, 210, 420, 420, 420, 420, 840, 840, 1260, 1260, 2310, 2310, 4620, 4620, 5460, 5460, 9240, 9240, 13860, 13860, 16380, 16380, 30030, 27720, 60060, 32760, 40040, 60060, 120120, 60060, 180180, 120120, 157080, 120120, 360360
OFFSET
6,2
MAPLE
L:= proc(m, n) option remember; local k;
if m = n then return {1} fi;
if m = 1 then return {n} fi;
`union`(seq(map(t -> ilcm(t, k), procname(m-1, n-k)), k=1..n-m+1))
end proc:
seq(max(L(6, i)), i=6..70); # Robert Israel, Jul 17 2026
MATHEMATICA
Table[Max[LCM@@@IntegerPartitions[n, {6}]], {n, 6, 60}] (* Harvey P. Dale, Jun 23 2023 *)
PROG
(PARI) a(n) = { my (v=0); forpart(p=n, v=max(v, lcm(Vec(p))), , [6, 6]); v } \\ Rémy Sigrist, Jul 01 2022
CROSSREFS
Cf. A008881.
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).
Sequence in context: A129648 A129649 A129650 * A355403 A319055 A379153
KEYWORD
nonn,changed
AUTHOR
Wesley Ivan Hurt, Jun 29 2022
STATUS
approved