login
A055093
Number of moved (non-fixed) elements in each permutation given in reversed colexicographic ordering A055089, i.e., the sum of their cycle lengths (excluding the 1-cycles, i.e., fixed elements).
8
0, 2, 2, 3, 3, 2, 2, 4, 3, 4, 4, 3, 3, 4, 2, 3, 4, 4, 4, 3, 3, 2, 4, 4, 2, 4, 4, 5, 5, 4, 3, 5, 4, 5, 5, 4, 4, 5, 3, 4, 5, 5, 5, 4, 4, 3, 5, 5, 3, 5, 4, 5, 5, 4, 2, 4, 3, 4, 4, 3, 4, 5, 4, 5, 5, 5, 5, 4, 5, 4, 5, 5, 4, 5, 3, 4, 5, 5, 3, 4, 2, 3, 4, 4, 4, 5, 4, 5, 5, 5, 5, 5, 5, 5, 4, 4, 5, 4, 4, 3, 5, 5, 4, 3, 3
OFFSET
0,2
COMMENTS
Also number of displacements for permutations in lexicographic order. - Joerg Arndt, Jan 22 2024
FORMULA
a(n) = A055090(n) + A055091(n).
a(n) = A275812(A290095(n)) = A060129(A060126(n)). - Antti Karttunen, Dec 30 2017
MAPLE
A055093(n) = count_nonfixed(convert(PermRevLexUnrank(j), 'disjcyc')).
count_nonfixed := l -> convert(map(nops, l), `+`);
# Procedure PermRevLexUnrank given in A055089.
KEYWORD
nonn
AUTHOR
Antti Karttunen, Apr 04 2000
EXTENSIONS
Entry revised by Antti Karttunen, Dec 30 2017
STATUS
approved