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 A057113 #6 May 20 2022 21:35:12 %S A057113 0,1,4,5,3,2,12,13,16,22,19,18,20,10,7,6,8,14,15,9,11,21,23,17,77,76, %T A057113 73,72,74,75,85,84,86,80,78,79,82,92,90,91,94,88,89,95,93,83,81,87,63, %U A057113 62,60,61,64,65,71,70,67,53,51,50,48,54,56,57,59,69,68,58,55,49,52,66,108,109,112,113,111,110,104,105,107,117,119,118,115,101,99,98,96,102 %N A057113 Positions of permutations produced by the transposition sequence A057112 in A055089. %H A057113 Sean A. Irvine, <a href="/A057113/b057113.txt">Table of n, a(n) for n = 0..119</a> %H A057113 Sean A. Irvine, <a href="/A057113/a057113.txt">Complete Maple program with all necessary functions</a> %F A057113 perm_ranks_seq := atp_perm_ranks(120); %p A057113 atp_perm_ranks := proc(upto_n) local t,a,p,i,k; p := convert([1],'disjcyc'); k := nops(factorial_base(upto_n))+1; a := []; for i from 1 to upto_n do a := [op(a),PermRevLexRank(convert(p,'permlist',k))]; t := adj_tp_seq(i); p := mulperms([[t,t+1]],p); od; RETURN(a); end; %Y A057113 PermRevLexRank given in A056019. %K A057113 nonn,fini,full %O A057113 0,3 %A A057113 _Antti Karttunen_, Aug 09 2000