login
A275803
a(n) = A051903(A275725(n)); maximal cycle sizes of finite permutations listed in the order A060117 / A060118.
4
1, 2, 2, 3, 2, 3, 2, 2, 3, 4, 3, 4, 2, 3, 3, 4, 2, 4, 2, 3, 2, 4, 3, 4, 2, 2, 2, 3, 2, 3, 3, 3, 4, 5, 4, 5, 3, 4, 4, 5, 3, 5, 3, 4, 3, 5, 4, 5, 2, 2, 3, 4, 3, 4, 3, 3, 4, 5, 4, 5, 2, 3, 4, 5, 3, 5, 2, 3, 3, 5, 4, 5, 2, 3, 3, 4, 2, 4, 2, 3, 4, 5, 3, 5, 3, 4, 4, 5, 3, 5, 2, 4, 3, 5, 3, 5, 2, 3, 2, 4, 3, 4, 2, 3, 3, 5, 4, 5, 2, 4, 3, 5, 3, 5, 3, 4, 3, 5, 4, 5, 2
OFFSET
0,2
FORMULA
a(n) = A051903(A275725(n)).
EXAMPLE
For n=27, which in factorial base (A007623) is "1011" and encodes (in A060118-order) permutation "23154" with one 3-cycle and one 2-cycle, the longest cycle has three elements, thus a(27) = 3.
PROG
(Scheme) (define (A275803 n) (A051903 (A275725 n)))
CROSSREFS
Cf. A261220 (gives the positions of 1 and 2's).
Differs from A060131 for the first time at n=27, where a(27) = 3, while A060131(27) = 6.
Sequence in context: A225416 A369871 A295784 * A060131 A343391 A024677
KEYWORD
nonn,base
AUTHOR
Antti Karttunen, Aug 10 2016
STATUS
approved