A060128 a(n) is the number of disjoint cycles (excluding 1-cycles, i.e., fixed elements) in the n-th permutation of A060117 and A060118.

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

Offset: 0

Author

Antti Karttunen, Mar 05 2001

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 0..40320
• Index entries for sequences related to factorial base representation

Crossrefs

Cf. A055090, A056170, A060118, A060120, A060129, A060130, A275725, A278225, A276004.

Cf. A276005 (positions where coincides with A060502).

Programs

Maple

A060128(n) = nops(convert(PermUnrank3L(n), 'disjcyc')); # Code for function PermUnrank3L given in A060118.

Formula

a(n) = A060129(n) - A060130(n).

From Antti Karttunen, Aug 07 2017: (Start)

a(n) = A056170(A275725(n)).

a(n) = A055090(A060120(n)).

a(n) = A060502(n) - A276004(n).

(End)