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 A055092 #20 Dec 30 2017 10:00:50 %S A055092 1,2,2,3,3,2,2,2,3,4,4,3,3,4,2,3,2,4,4,3,3,2,4,2,2,2,2,6,6,2,3,6,4,5, %T A055092 5,4,4,5,3,4,6,5,5,4,4,3,5,6,3,6,4,5,5,4,2,2,3,4,4,3,2,6,4,5,5,6,6,2, %U A055092 5,4,6,5,4,5,3,4,6,5,3,4,2,3,2,4,4,5,2,6,6,5,5,6,6,5,2,4,5,4,4,3,5,6,4,3,3 %N A055092 Order of each permutation given in reversed colexicographic ordering A055089, i.e., the least common multiple of their cycle lengths. %H A055092 Antti Karttunen, <a href="/A055092/b055092.txt">Table of n, a(n) for n = 0..40320</a> %H A055092 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a> %F A055092 a(n) = A072411(A290095(n)) = A060131(A060126(n)). - _Antti Karttunen_, Dec 30 2017 %p A055092 A055092(n) = count_permorder(convert(PermRevLexUnrank(j), 'disjcyc')). %p A055092 count_permorder := proc(l) local c,t; t := 1; for c in l do t := ilcm(t,nops(c)); od; RETURN(t); end; %p A055092 # Procedure PermRevLexUnrank given in A055089. %Y A055092 Cf. A055089, A060131, A072411, A290095. %K A055092 nonn %O A055092 0,2 %A A055092 _Antti Karttunen_, Apr 04 2000 %E A055092 Entry revised by _Antti Karttunen_, Dec 30 2017