|
%I #11 Aug 11 2016 23:45:55
%S 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,
%T 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,
%U 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
%N a(n) = A051903(A275725(n)); maximal cycle sizes of finite permutations listed in the order A060117 / A060118.
%H Antti Karttunen, <a href="/A275803/b275803.txt">Table of n, a(n) for n = 0..40320</a>
%H <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>
%F a(n) = A051903(A275725(n)).
%e 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.
%o (Scheme) (define (A275803 n) (A051903 (A275725 n)))
%Y Cf. A007623, A060117, A060118.
%Y Cf. A051903, A275725.
%Y Cf. A261220 (gives the positions of 1 and 2's).
%Y Differs from A060131 for the first time at n=27, where a(27) = 3, while A060131(27) = 6.
%K nonn,base
%O 0,2
%A _Antti Karttunen_, Aug 10 2016
|
