login
This site is supported by donations to The OEIS Foundation.

 

Logo


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

0,8

LINKS

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

Index entries for sequences related to factorial base representation

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)

MAPLE

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

CROSSREFS

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

Cf. A276005 (positions where coincides with A060502).

Sequence in context: A031260 A055090 A290106 * A290104 A031280 A134870

Adjacent sequences:  A060125 A060126 A060127 * A060129 A060130 A060131

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified September 20 09:09 EDT 2017. Contains 292261 sequences.