This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055091 Minimum number of transpositions needed to represent each permutation given in reversed colexicographic ordering A055089. 9
 0, 1, 1, 2, 2, 1, 1, 2, 2, 3, 3, 2, 2, 3, 1, 2, 2, 3, 3, 2, 2, 1, 3, 2, 1, 2, 2, 3, 3, 2, 2, 3, 3, 4, 4, 3, 3, 4, 2, 3, 3, 4, 4, 3, 3, 2, 4, 3, 2, 3, 3, 4, 4, 3, 1, 2, 2, 3, 3, 2, 2, 3, 3, 4, 4, 3, 3, 2, 4, 3, 3, 4, 3, 4, 2, 3, 3, 4, 2, 3, 1, 2, 2, 3, 3, 4, 2, 3, 3, 4, 4, 3, 3, 4, 2, 3, 4, 3, 3, 2, 4, 3, 3, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Antti Karttunen, Table of n, a(n) for n = 0..40320 FORMULA a(n) = A055093(n) - A055090(n). a(n) = A046660(A290095(n)) = A060130(A060126(n)). - Antti Karttunen, Dec 30 2017 MAPLE with(group); [seq(count_transpositions(convert(PermRevLexUnrank(j), 'disjcyc')), j=0..)]; count_transpositions := proc(l) local c, t; t := 0; for c in l do t := t + (nops(c)-1); od; RETURN(t); end; # Procedure PermRevLexUnrank given in A055089. CROSSREFS Cf. A046660, A055089, A055090, A055093, A060130, A290095. Cf. also A034968 (minimum number of adjacent transpositions). Sequence in context: A318439 A106180 A274369 * A014678 A164516 A016533 Adjacent sequences:  A055088 A055089 A055090 * A055092 A055093 A055094 KEYWORD nonn AUTHOR Antti Karttunen, Apr 18 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 6 04:14 EST 2019. Contains 329784 sequences. (Running on oeis4.)