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 A129648 #14 Mar 17 2023 01:28:44 %S A129648 0,0,1,2,3,6,6,12,15,30,21,60,35,84,105,140,84,210,165,280,315,360, %T A129648 385,504,495,630,693,792,819,990,1001,1170,1287,1430,1365,1716,1683, %U A129648 2002,2145,2310,2431,2730,2805,3120,3315,3570,3705,4080,4199,4560,4845,5168 %N A129648 Largest order of a permutation of n elements with exactly 3 cycles. Also the largest LCM of a 3-partition of n. %C A129648 a(n) is asymptotic to (n^3)/27. %H A129648 Alois P. Heinz, <a href="/A129648/b129648.txt">Table of n, a(n) for n = 1..1000</a> %H A129648 <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a> %e A129648 a(9) = 15 because 9 = 5+3+1 and lcm(1,3,5) = 15 is maximal. %t A129648 Max[LCM @@@ Compositions[ #, 3]] & /@ Range[1, n] %Y A129648 Cf. A000793, A129651. %Y A129648 Maximal LCM of k positive integers with sum n for k = 2..7: A129647 (k=2), this sequence (k=3), A129649 (k=4), A129650 (k=5), A355367 (k=6), A355403 (k=7). %K A129648 nonn %O A129648 1,4 %A A129648 Nickolas Reynolds (nickels(AT)gmail.com), Apr 25 2007