login
A013560
Cardinality of the permutation (k, k-1, ..., 2, 1)(n, n-1, ..., k+1) in an exchange shuffle applied in all n^n possible ways to (1,2,...,n).
2
1, 2, 5, 15, 47, 159, 543, 1931, 6879, 25118, 91693
OFFSET
1,2
LINKS
Sean A. Irvine, Java program (github)
Frank Schmidt and Rodica Simion, Card shuffling and a transformation on S_n, Aequationes Math. 44 (1992), no. 1, 11-34.
FORMULA
a(n) <= A192053(n) [Proposition 2.9 of Schmidt and Simion]. - Sean A. Irvine, Mar 29 2022
CROSSREFS
Cf. A192053.
Sequence in context: A149921 A149922 A192053 * A149923 A219231 A149924
KEYWORD
nonn,more
AUTHOR
EXTENSIONS
Title clarified and a(7)-a(11) from Sean A. Irvine, Mar 29 2022
STATUS
approved