login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 10
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 (list; graph; refs; listen; history; text; internal format)
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 A308450 A229123

Adjacent sequences:  A060126 A060127 A060128 * A060130 A060131 A060132

KEYWORD

nonn

AUTHOR

Antti Karttunen, Mar 05 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 28 17:15 EDT 2021. Contains 346335 sequences. (Running on oeis4.)