A055090 Number of cycles (excluding fixed points) of the n-th finite permutation in reversed colexicographic ordering (A055089).

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

Offset

0,8

Comments

Among the first n! entries k appears A136394(n,k) times. - Tilman Piesk, Apr 06 2012

Links

Tilman Piesk, Table of n, a(n) for n = 0..5039

Tilman Piesk, Table for A198380 (a[n] is the number of addends in parentheses on the right of this table)

Tilman Piesk, Permutations and partitions in the OEIS (Wikiversity)

Index entries for sequences related to factorial base representation

Formula

a(n) = A055093(n) - A055091(n).

a(n) = A056170(A290095(n)) = A060128(A060126(n)). - Antti Karttunen, Dec 30 2017

Maple

with(group); seq(nops(convert(PermRevLexUnrank(j), 'disjcyc')), j=0..)];
# Procedure PermRevLexUnrank given in A055089.

Crossrefs

Cf. A195663, A195664, A055089 (ordered finite permutations).

Cf. A198380 (cycle type of the n-th finite permutation).

Cf. A136394, A055089, A055090, A055093, A055091, A060128, A290095.

Sequence in context: A031260 A360157 A298735 * A290106 A359433 A349340

Adjacent sequences: A055087 A055088 A055089 * A055091 A055092 A055093

Keyword

nonn

Author

Antti Karttunen, Apr 18 2000

Extensions

Name changed by Tilman Piesk, Apr 06 2012

Status

approved