|
%I #17 Aug 11 2016 23:38:29
%S 0,2,2,3,2,3,2,4,3,4,3,4,2,3,3,4,4,4,2,3,4,4,3,4,2,4,4,5,4,5,3,5,4,5,
%T 4,5,3,4,4,5,5,5,3,4,5,5,4,5,2,4,3,4,3,4,3,5,4,5,4,5,4,5,4,5,5,5,4,5,
%U 5,5,4,5,2,3,3,4,4,4,4,5,4,5,5,5,3,4,4,5,5,5,4,4,5,5,5,5,2,3,4,4,3,4,4,5,5,5,4,5,4,4,5,5,5,5,3,4,5,5,4,5,2
%N Number of moved (non-fixed) elements in the permutation with rank number n in lists A060117 (or in A060118), i.e., the sum of the lengths of all cycles larger than one in that permutation.
%H Antti Karttunen, <a href="/A060129/b060129.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) = A060128(n) + A060130(n).
%F From _Antti Karttunen_, Aug 11 2016: (Start)
%F a(n) = A275812(A275725(n)).
%F a(n) = 1 + A084558(n) - A275851(n).
%F Other identities. For all n >= 0:
%F a(n) = A055093(A060120(n)).
%F a(A000142(n)) = 2.
%F (End)
%o (Scheme, two versions)
%o (define (A060129 n) (A275812 (A275725 n)))
%o (define (A060129 n) (- (+ 1 (A084558 n)) (A275851 n)))
%Y Cf. also A000142, A055093, A060117, A060118, A060120, A060128, A060130, A084558, A275851.
%K nonn
%O 0,2
%A _Antti Karttunen_, Mar 05 2001
|
