|
Search: id:A129648
|
|
|
| A129648 |
|
Largest order of a permutation of n elements with exactly 3 cycles. Also the largest LCM of a 3-partition of n. |
|
+0
5
|
|
| 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; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
a(n) is asymptotic to (n^3)/27
|
|
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
|
Cf. A000793, A129647, A129649, A129650, A129651.
Sequence in context: A069808 A131259 A143177 this_sequence A129649 A129650 A007894
Adjacent sequences: A129645 A129646 A129647 this_sequence A129649 A129650 A129651
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Nickolas Reynolds (nickels(AT)gmail.com), Apr 25 2007
|
|
|
Search completed in 0.002 seconds
|
