id:A055091 - OEIS Search Results

Search: id:A055091

Displaying 1-1 of 1 results found.

page 1

Minimum number of transpositions needed to represent each permutation in the canonical list A055089.

+0
6

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; listen)

	OFFSET	`0,4`
	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;`
	CROSSREFS	`A055091[n] = A055093[n] - A055090[n]` `For minimum number of _adjacent_ transpositions required, see A034968.` `Sequence in context: A053257 A112399 A106180 this_sequence A014678 A016533 A122915` `Adjacent sequences: A055088 A055089 A055090 this_sequence A055092 A055093 A055094`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen Apr 18 2000`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research