A060130 - OEIS

This site is supported by donations to The OEIS Foundation.

A060130

Minimum number of transpositions needed to compose each permutation in the lists A060117/A060118; number of nonzero digits in factorial base representation (A007623) of n.

0, 1, 1, 2, 1, 2, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 2, 3, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 1, 2, 2, 3, 2, 3, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 1, 2, 2, 3, 2, 3, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 1, 2, 2, 3, 2, 3, 2, 3, 3 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,4`
	LINKS	`Table of n, a(n) for n=0..104.`
	FORMULA	`a(n) = count_nonfixed(convert(PermUnrank3R(n), 'disjcyc'))-nops(convert(PermUnrank3R(n), 'disjcyc')) or nops(fac_base(n))-nops(positions(0, fac_base(n)))`
	CROSSREFS	`A060130[n] = A060129[n] - A060128[n]. Cf. A055091, A060131.` `Sequence in context: A193929 A132881 A224702 * A185317 A008682 A112224` `Adjacent sequences: A060127 A060128 A060129 * A060131 A060132 A060133`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen Mar 02 2001`
	STATUS	`approved`

Content is available under The OEIS End-User License Agreement .

Last modified May 25 05:13 EDT 2013. Contains 225643 sequences.