|
|
A129648
|
|
Largest order of a permutation of n elements with exactly 3 cycles. Also the largest LCM of a 3-partition of n.
|
|
8
|
|
|
0, 0, 1, 2, 3, 6, 6, 12, 15, 30, 21, 60, 35, 84, 105, 140, 84, 210, 165, 280, 315, 360, 385, 504, 495, 630, 693, 792, 819, 990, 1001, 1170, 1287, 1430, 1365, 1716, 1683, 2002, 2145, 2310, 2431, 2730, 2805, 3120, 3315, 3570, 3705, 4080, 4199, 4560, 4845, 5168
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
a(n) is asymptotic to (n^3)/27.
|
|
LINKS
|
|
|
EXAMPLE
|
a(9) = 15 because 9 = 5+3+1 and lcm(1,3,5) = 15 is maximal.
|
|
MATHEMATICA
|
Max[LCM @@@ Compositions[ #, 3]] & /@ Range[1, n]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Nickolas Reynolds (nickels(AT)gmail.com), Apr 25 2007
|
|
STATUS
|
approved
|
|
|
|