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