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 A225646 #19 Mar 05 2025 13:44:23
%S A225646 1,1,2,6,12,30,30,84,120,180,210,330,420,780,630,840,1680,3570,1386,
%T A225646 7980,1980,4620,6930,19320,9240,23100,30030,41580,16380,73080,10920,
%U A225646 143220,110880,120120,157080,120120,180180,512820,311220,240240,360360,1231230,180180
%N 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.
%C A225646 Second row of table A225640.
%C A225646 a(0)=1 by convention.
%H A225646 <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a>
%o A225646 (Scheme)
%o A225646 (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)))
%o A225646 (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))))))))
%Y A225646 Cf. A225640, A225642, A225652, A000793, A225655.
%K A225646 nonn
%O A225646 0,3
%A A225646 _Antti Karttunen_, May 15 2013