cp's OEIS Frontend

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.

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

Original entry on oeis.org

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

Views

Author

Fausto A. C. Cariboni, Jan 02 2021

Keywords

Comments

a(n) <= A123131(n).

Examples

			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.
		

Crossrefs

Programs

  • 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