This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A275803 #11 Aug 11 2016 23:45:55 %S A275803 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 A275803 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 A275803 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 A275803 a(n) = A051903(A275725(n)); maximal cycle sizes of finite permutations listed in the order A060117 / A060118. %H A275803 Antti Karttunen, <a href="/A275803/b275803.txt">Table of n, a(n) for n = 0..40320</a> %H A275803 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a> %F A275803 a(n) = A051903(A275725(n)). %e A275803 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 A275803 (Scheme) (define (A275803 n) (A051903 (A275725 n))) %Y A275803 Cf. A007623, A060117, A060118. %Y A275803 Cf. A051903, A275725. %Y A275803 Cf. A261220 (gives the positions of 1 and 2's). %Y A275803 Differs from A060131 for the first time at n=27, where a(27) = 3, while A060131(27) = 6. %K A275803 nonn,base %O A275803 0,2 %A A275803 _Antti Karttunen_, Aug 10 2016