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 A060128 #25 Aug 08 2017 22:15:42 %S A060128 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, %T A060128 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, %U A060128 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 %N 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. %H A060128 Antti Karttunen, <a href="/A060128/b060128.txt">Table of n, a(n) for n = 0..40320</a> %H A060128 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a> %F A060128 a(n) = A060129(n) - A060130(n). %F A060128 From _Antti Karttunen_, Aug 07 2017: (Start) %F A060128 a(n) = A056170(A275725(n)). %F A060128 a(n) = A055090(A060120(n)). %F A060128 a(n) = A060502(n) - A276004(n). %F A060128 (End) %p A060128 A060128(n) = nops(convert(PermUnrank3L(n), 'disjcyc')); # Code for function PermUnrank3L given in A060118. %Y A060128 Cf. A055090, A056170, A060118, A060120, A060129, A060130, A275725, A278225, A276004. %Y A060128 Cf. A276005 (positions where coincides with A060502). %K A060128 nonn %O A060128 0,8 %A A060128 _Antti Karttunen_, Mar 05 2001