|
|
A233440
|
|
Triangle read by rows: T(n, k) = n*binomial(n, k)*A000757(k), 0 <= k <= n.
|
|
13
|
|
|
0, 1, 0, 2, 0, 0, 3, 0, 0, 3, 4, 0, 0, 16, 4, 5, 0, 0, 50, 25, 40, 6, 0, 0, 120, 90, 288, 216, 7, 0, 0, 245, 245, 1176, 1764, 1603, 8, 0, 0, 448, 560, 3584, 8064, 14656, 13000, 9, 0, 0, 756, 1134, 9072, 27216, 74196, 131625, 118872, 10, 0, 0, 1200, 2100, 20160, 75600, 274800, 731250, 1320800, 1202880
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
For n >= 0, 0 <= k <= n, T(n, k) is the number of permutations of n symbols that k-commute with an n-cycle (we say that two permutations f and g k-commute if H(fg, gf) = k, where H(, ) denotes the Hamming distance between permutations).
|
|
LINKS
|
|
|
FORMULA
|
T(n,k) = n*C(n,k)*A000757(k), 0 <= k <= n.
Bivariate e.g.f.: G(z, u) = z*exp(z*(1-u))*(u/(1-z*u)+(1-log(1-z*u))*(1-u)).
|
|
EXAMPLE
|
For n = 4 and k = 4, T(4, 4) = 4 because all the permutations of 4 symbols that 4-commute with permutation (1, 2, 3, 4) are (1, 3), (2, 4), (1, 2)(3, 4) and (1, 4)(2, 3).
|
|
MATHEMATICA
|
T[n_, k_] := n Binomial[n, k] ((-1)^k+Sum[(-1)^j k!/(k-j)/j!, {j, 0, k-1}]);
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|