|
%I #35 Dec 30 2017 10:00:14
%S 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,
%T 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,
%U 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
%N Number of cycles (excluding fixed points) of the n-th finite permutation in reversed colexicographic ordering (A055089).
%C Among the first n! entries k appears A136394(n,k) times. - _Tilman Piesk_, Apr 06 2012
%H Tilman Piesk, <a href="/A055090/b055090.txt">Table of n, a(n) for n = 0..5039</a>
%H Tilman Piesk, <a href="https://oeis.org/A198380/a198380_1.txt">Table for A198380</a> (a[n] is the number of addends in parentheses on the right of this table)
%H Tilman Piesk, <a href="https://en.wikiversity.org/wiki/Permutations_and_partitions_in_the_OEIS">Permutations and partitions in the OEIS</a> (Wikiversity)
%H <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>
%F a(n) = A055093(n) - A055091(n).
%F a(n) = A056170(A290095(n)) = A060128(A060126(n)). - _Antti Karttunen_, Dec 30 2017
%p with(group); seq(nops(convert(PermRevLexUnrank(j),'disjcyc')),j=0..)];
%p # Procedure PermRevLexUnrank given in A055089.
%Y Cf. A195663, A195664, A055089 (ordered finite permutations).
%Y Cf. A198380 (cycle type of the n-th finite permutation).
%Y Cf. A136394, A055089, A055090, A055093, A055091, A060128, A290095.
%K nonn
%O 0,8
%A _Antti Karttunen_, Apr 18 2000
%E Name changed by _Tilman Piesk_, Apr 06 2012
|
