This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A225646 a(n) = lcm(n,p1,p2,...,pk) for such a partition of n which maximizes this value among all partitions {p1+p2+...pk} of n. 5
 1, 1, 2, 6, 12, 30, 30, 84, 120, 180, 210, 330, 420, 780, 630, 840, 1680, 3570, 1386, 7980, 1980, 4620, 6930, 19320, 9240, 23100, 30030, 41580, 16380, 73080, 10920, 143220, 110880, 120120, 157080, 120120, 180180, 512820, 311220, 240240, 360360, 1231230, 180180 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Second row of table A225640. a(0)=1 by convention. LINKS PROG (Scheme): (define (A225646 n) (let ((maxlcm (list 1))) (fold_over_partitions_of n n lcm (lambda (p) (set-car! maxlcm (max (car maxlcm) p)))) (car maxlcm))) (define (fold_over_partitions_of m initval addpartfun colfun) (let recurse ((m m) (b m) (n 0) (partition initval)) (cond ((zero? m) (colfun partition)) (else (let loop ((i 1)) (recurse (- m i) i (+ 1 n) (addpartfun i partition)) (if (< i (min b m)) (loop (+ 1 i)))))))) CROSSREFS Cf. A225640, A225642, A225652, A000793, A225655. Sequence in context: A324408 A229487 A195166 * A225627 A237704 A181826 Adjacent sequences:  A225643 A225644 A225645 * A225647 A225648 A225649 KEYWORD nonn AUTHOR Antti Karttunen, May 15 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 18 07:24 EDT 2019. Contains 324203 sequences. (Running on oeis4.)