|
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
|
|
|
%I #13 Mar 29 2022 16:37:06
%S 1,2,5,15,47,159,543,1931,6879,25118,91693
%N 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).
%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a013/A013560.java">Java program</a> (github)
%H Frank Schmidt and Rodica Simion, <a href="https://doi.org/10.1007/BF01834201">Card shuffling and a transformation on S_n</a>, Aequationes Math. 44 (1992), no. 1, 11-34.
%F a(n) <= A192053(n) [Proposition 2.9 of Schmidt and Simion]. - _Sean A. Irvine_, Mar 29 2022
%Y Cf. A192053.
%K nonn,more
%O 1,2
%A _N. J. A. Sloane_.
%E Title clarified and a(7)-a(11) from _Sean A. Irvine_, Mar 29 2022
|
