id:A060131 - OEIS Search Results

Search: id:A060131

Displaying 1-1 of 1 results found.

page 1

Order of each permutation in the sequences A060117/A060118, i.e. the least common multiple of the cycle lengths.

+0
4

1, 2, 2, 3, 2, 3, 2, 2, 3, 4, 3, 4, 2, 3, 3, 4, 2, 4, 2, 3, 2, 4, 3, 4, 2, 2, 2, 6, 2, 6, 3, 6, 4, 5, 4, 5, 3, 4, 4, 5, 6, 5, 3, 4, 6, 5, 4, 5, 2, 2, 3, 4, 3, 4, 3, 6, 4, 5, 4, 5, 2, 6, 4, 5, 6, 5, 2, 6, 6, 5, 4, 5, 2, 3, 3, 4, 2, 4, 2, 6, 4, 5, 6, 5, 3, 4, 4, 5, 6, 5, 2, 4, 6, 5, 6, 5, 2, 3, 2, 4, 3, 4, 2, 6, 6 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`a(n) = count_permorder(convert(PermUnrank3L(n), 'disjcyc'))`
	CROSSREFS	`See A055092 for count_permorder.` `Sequence in context: A068050 A083900 A113517 this_sequence A024677 A029374 A049237` `Adjacent sequences: A060128 A060129 A060130 this_sequence A060132 A060133 A060134`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen, Mar 05, 2001`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research