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 A060126 #24 Sep 09 2017 19:44:17 %S A060126 0,1,2,3,5,4,6,7,8,9,11,10,14,15,12,13,16,17,23,22,19,18,21,20,24,25, %T A060126 26,27,29,28,30,31,32,33,35,34,38,39,36,37,40,41,47,46,43,42,45,44,54, %U A060126 55,56,57,59,58,48,49,50,51,53,52,60,61,62,63,65,64,67,66,71,70,68,69 %N A060126 Positions of permutations of A055089 in the permutation sequence A060117. %C A060126 Together with the inverse A060119 this can be used to conjugate between "multiplication tables" of A261096 & A261216 (and for example, their main diagonals A261099 & A261219, or between involutions A056019 & A060125, see the Formula section) that have been computed for these two common alternative orderings of permutations. - _Antti Karttunen_, Sep 28 2016 %H A060126 Antti Karttunen, <a href="/A060126/b060126.txt">Table of n, a(n) for n = 0..5040</a> %H A060126 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a> %H A060126 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A060126 Other identities. For all n >= 0: %F A060126 a(A056019(A060119(n))) = A060125(n). %p A060126 # Procedure PermRank3R is given in A060125 and PermRevLexUnrank in A055089: %p A060126 A060126(n) = PermRank3R(PermRevLexUnrank(n)); %Y A060126 Inverse: A060119. %Y A060126 Cf. A060132 (fixed points). %Y A060126 Cf. A055089, A060117. %Y A060126 Cf. also A056019, A060125, A060127, A261096, A261099, A261216, A261219. %K A060126 nonn,base %O A060126 0,3 %A A060126 _Antti Karttunen_, Mar 02 2001 %E A060126 Edited by _Antti Karttunen_, Sep 28 2016