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 A060129 #17 Aug 11 2016 23:38:29 %S A060129 0,2,2,3,2,3,2,4,3,4,3,4,2,3,3,4,4,4,2,3,4,4,3,4,2,4,4,5,4,5,3,5,4,5, %T A060129 4,5,3,4,4,5,5,5,3,4,5,5,4,5,2,4,3,4,3,4,3,5,4,5,4,5,4,5,4,5,5,5,4,5, %U A060129 5,5,4,5,2,3,3,4,4,4,4,5,4,5,5,5,3,4,4,5,5,5,4,4,5,5,5,5,2,3,4,4,3,4,4,5,5,5,4,5,4,4,5,5,5,5,3,4,5,5,4,5,2 %N A060129 Number of moved (non-fixed) elements in the permutation with rank number n in lists A060117 (or in A060118), i.e., the sum of the lengths of all cycles larger than one in that permutation. %H A060129 Antti Karttunen, <a href="/A060129/b060129.txt">Table of n, a(n) for n = 0..40320</a> %H A060129 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a> %F A060129 a(n) = A060128(n) + A060130(n). %F A060129 From _Antti Karttunen_, Aug 11 2016: (Start) %F A060129 a(n) = A275812(A275725(n)). %F A060129 a(n) = 1 + A084558(n) - A275851(n). %F A060129 Other identities. For all n >= 0: %F A060129 a(n) = A055093(A060120(n)). %F A060129 a(A000142(n)) = 2. %F A060129 (End) %o A060129 (Scheme, two versions) %o A060129 (define (A060129 n) (A275812 (A275725 n))) %o A060129 (define (A060129 n) (- (+ 1 (A084558 n)) (A275851 n))) %Y A060129 Cf. also A000142, A055093, A060117, A060118, A060120, A060128, A060130, A084558, A275851. %K A060129 nonn %O A060129 0,2 %A A060129 _Antti Karttunen_, Mar 05 2001