%I #25 Aug 08 2017 22:15:42
%S 0,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,2,1,1,1,2,1,1,1,1,2,2,2,2,2,1,2,1,1,
%T 1,1,1,1,1,1,2,1,1,1,2,1,1,1,1,2,1,1,1,1,1,2,1,1,1,1,2,2,1,1,2,1,2,2,
%U 2,1,1,1,1,1,1,1,2,1,2,2,1,1,2,1,1,1,1,1,2,1,2,1,2,1,2,1,1,1,2,1,1,1,2,2,2
%N a(n) is the number of disjoint cycles (excluding 1-cycles, i.e., fixed elements) in the n-th permutation of A060117 and A060118.
%H Antti Karttunen, <a href="/A060128/b060128.txt">Table of n, a(n) for n = 0..40320</a>
%H <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>
%F a(n) = A060129(n) - A060130(n).
%F From _Antti Karttunen_, Aug 07 2017: (Start)
%F a(n) = A056170(A275725(n)).
%F a(n) = A055090(A060120(n)).
%F a(n) = A060502(n) - A276004(n).
%F (End)
%p A060128(n) = nops(convert(PermUnrank3L(n), 'disjcyc')); # Code for function PermUnrank3L given in A060118.
%Y Cf. A055090, A056170, A060118, A060120, A060129, A060130, A275725, A278225, A276004.
%Y Cf. A276005 (positions where coincides with A060502).
%K nonn
%O 0,8
%A _Antti Karttunen_, Mar 05 2001