The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055092 Order of each permutation given in reversed colexicographic ordering A055089, i.e., the least common multiple of their cycle lengths. 7
 1, 2, 2, 3, 3, 2, 2, 2, 3, 4, 4, 3, 3, 4, 2, 3, 2, 4, 4, 3, 3, 2, 4, 2, 2, 2, 2, 6, 6, 2, 3, 6, 4, 5, 5, 4, 4, 5, 3, 4, 6, 5, 5, 4, 4, 3, 5, 6, 3, 6, 4, 5, 5, 4, 2, 2, 3, 4, 4, 3, 2, 6, 4, 5, 5, 6, 6, 2, 5, 4, 6, 5, 4, 5, 3, 4, 6, 5, 3, 4, 2, 3, 2, 4, 4, 5, 2, 6, 6, 5, 5, 6, 6, 5, 2, 4, 5, 4, 4, 3, 5, 6, 4, 3, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Antti Karttunen, Table of n, a(n) for n = 0..40320 Index entries for sequences related to factorial base representation FORMULA a(n) = A072411(A290095(n)) = A060131(A060126(n)). - Antti Karttunen, Dec 30 2017 MAPLE A055092(n) = count_permorder(convert(PermRevLexUnrank(j), 'disjcyc')). count_permorder := proc(l) local c, t; t := 1; for c in l do t := ilcm(t, nops(c)); od; RETURN(t); end; # Procedure PermRevLexUnrank given in A055089. CROSSREFS Cf. A055089, A060131, A072411, A290095. Sequence in context: A344259 A165299 A071820 * A213202 A234972 A367007 Adjacent sequences: A055089 A055090 A055091 * A055093 A055094 A055095 KEYWORD nonn AUTHOR Antti Karttunen, Apr 04 2000 EXTENSIONS Entry revised by Antti Karttunen, Dec 30 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 3 17:50 EST 2024. Contains 370512 sequences. (Running on oeis4.)