A340267 Maximum LCM of partitions of n into pairwise coprime parts that are >= 2.

2, 3, 4, 6, 6, 12, 15, 20, 30, 30, 60, 42, 84, 105, 140, 210, 210, 420, 280, 330, 360, 840, 504, 1260, 1155, 1540, 2310, 2520, 4620, 3080, 5460, 3960, 9240, 5544, 13860, 6930, 16380, 15015, 27720, 30030, 32760, 60060, 40040, 45045, 51480, 120120, 72072, 180180

Offset

2,1

Comments

a(n) <= A123131(n).

Links

Fausto A. C. Cariboni, Table of n, a(n) for n = 2..260

Example

For n=22 we have a(22) = 360 since 22 = 5 + 8 + 9 and lcm([5, 8, 9]) = 360.
Note a(22) = 360 < A123131(22) = 420.

Prog

(PARI) isok(p) = {for (i=1, #p, for (j=i+1, #p, if (gcd(p[i], p[j]) > 1, return(0)); ); ); return(1); }
a(n) = {my(x=1); forpart(p=n, if ((vecmin(p)>=2) && isok(p), x = max(x, lcm(Vec(p)))); ); x; } \\ Michel Marcus, Jan 03 2021

Crossrefs

Cf. A007359, A007360, A123131.

Sequence in context: A210733 A265564 A064764 * A123131 A206398 A000793

Adjacent sequences: A340264 A340265 A340266 * A340268 A340269 A340270

Keyword

nonn

Author

Fausto A. C. Cariboni, Jan 02 2021

Status

approved