id:A055090 - OEIS Search Results

Search: id:A055090

Displaying 1-1 of 1 results found.

page 1

Number of disjoint cycles (excluding 1-cycles, i.e. fixed terms) in canonical list of permutations in reversed lexicographic ordering (A055089).

+0
5

0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 1, 1, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1 (list; graph; listen)

	OFFSET	`0,8`
	MAPLE	`with(group); seq(nops(convert(PermRevLexUnrank(j), 'disjcyc')), j=0..)];`
	CROSSREFS	`A055090[n] = A055093[n] - A055091[n]` `Sequence in context: A031226 A031242 A031260 this_sequence A060128 A031280 A134870` `Adjacent sequences: A055087 A055088 A055089 this_sequence A055091 A055092 A055093`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen Apr 18 2000`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research