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 A383459 #7 May 27 2025 19:21:13 %S A383459 1,1,1,1,2,1,2,2,2,3,2,3,4,3,3,3,4,3,4,5,5,4,4,5,4 %N A383459 Minimum number of cycles in any permutation in S_n of the highest order (A000793(n)). %C A383459 Landau's function g(n) = A000793(n) gives the maximum order of any permutation on n elements. %C A383459 The number of permutations of order g(n) is A074059, and the number of different cycle types of permutations of order g(n) is A074064. a(n) is the maximum number of cycles in any permutation of order g(n), and A383459(n) is the minimum number of cycles in any permutation of order g(n). %e A383459 There are two different cycle types of permutations in S_6 of the maximum order g(6) = 6, for example (123456) and (12)(345)(6). The minimum number of cycles is a(6) = 1 and maximum number is A383458(6) = 3. %Y A383459 Cf. A000793, A074059, A074064, A383458. %K A383459 nonn,more %O A383459 1,5 %A A383459 _Anand Jain_, Mar 22 2025