login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055092 Order of each permutation in the canonical list A055089, i.e. the least common multiple of the cycle lengths. 3
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; internal format)
OFFSET

0,2

FORMULA

a(n) = count_permorder(convert(PermRevLexUnrank(j), 'disjcyc'))

MAPLE

count_permorder := proc(l) local c, t; t := 1; for c in l do t := ilcm(t, nops(c)); od; RETURN(t); end;

CROSSREFS

Sequence in context: A188817 A165299 A071820 * A130326 A059906 A112046

Adjacent sequences:  A055089 A055090 A055091 * A055093 A055094 A055095

KEYWORD

nonn

AUTHOR

Antti Karttunen Apr 04 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 05:35 EST 2012. Contains 205570 sequences.