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

Author

Antti Karttunen, Apr 18 2000

Keywords

• nonn

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

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.

Programs

Maple

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

Formula

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

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

Extensions

Name changed by Tilman Piesk, Apr 06 2012