A060129 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.

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, 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, 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

Offset

0,2

Links

Antti Karttunen, Table of n, a(n) for n = 0..40320

Index entries for sequences related to factorial base representation

Formula

a(n) = A060128(n) + A060130(n).

From Antti Karttunen, Aug 11 2016: (Start)

a(n) = A275812(A275725(n)).

a(n) = 1 + A084558(n) - A275851(n).

Other identities. For all n >= 0:

a(n) = A055093(A060120(n)).

a(A000142(n)) = 2.

(End)

Prog

(Scheme, two versions)
(define (A060129 n) (A275812 (A275725 n)))
(define (A060129 n) (- (+ 1 (A084558 n)) (A275851 n)))

Crossrefs

Cf. also A000142, A055093, A060117, A060118, A060120, A060128, A060130, A084558, A275851.

Sequence in context: A080226 A060741 A125747 * A327161 A350067 A308450

Adjacent sequences: A060126 A060127 A060128 * A060130 A060131 A060132

Keyword

nonn

Author

Antti Karttunen, Mar 05 2001

Status

approved