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 A129650 #12 Mar 17 2023 01:27:59 %S A129650 0,0,0,0,1,2,3,6,6,12,15,30,30,60,60,84,105,210,210,420,420,420,420, %T A129650 840,840,1260,1260,2310,1540,4620,2520,5460,4620,9240,5460,13860,9240, %U A129650 16380,15015,27720,13860,32760,19635,40040,45045,51480,32760,72072,58905 %N A129650 Largest order of a permutation of n elements with exactly 5 cycles. Also the largest LCM of a 5-partition of n. %C A129650 a(n) is asymptotic to n^5/3125. %H A129650 <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a> %e A129650 a(29)=1540 because 29 = 11+7+5+4+2 and lcm(2,4,5,7,11) = 1540 is maximal. %t A129650 Max[LCM @@@ Compositions[ #, 5]] & /@ Range[1, n] %Y A129650 Cf. A000793, A129651. %Y A129650 Maximal LCM of k positive integers with sum n for k = 2..7: A129647 (k=2), A129648 (k=3), A129649 (k=4), this sequence (k=5), A355367 (k=6), A355403 (k=7). %K A129650 nonn %O A129650 1,6 %A A129650 Nickolas Reynolds (nickels(AT)gmail.com), Apr 25 2007