id:A055092 - OEIS Search Results

Search: id:A055092

Displaying 1-1 of 1 results found.

page 1

Order of each permutation in the canonical list A055089, i.e. the least common multiple of the cycle lengths.

+0
4

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

	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: A087175 A165299 A071820 this_sequence A130326 A059906 A112046` `Adjacent sequences: A055089 A055090 A055091 this_sequence A055093 A055094 A055095`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen Apr 04 2000`

page 1

Search completed in 0.002 seconds

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.

AT&T Labs Research