OFFSET
0,3
COMMENTS
Each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..449
Wikipedia, Permutation
EXAMPLE
a(3) = 13 because the sum of the second entries in all cycles of all permutations of [3] ((123), (132), (12)(3), (13)(2), (1)(23), (1)(2)(3)) is 2+3+2+3+3+0 = 13.
MAPLE
a:= proc(n) option remember; `if`(n<3, n*(n-1),
((2*n^2+3*n-1)*a(n-1)-(n-1)*n*(n+2)*a(n-2))/(n+1))
end:
seq(a(n), n=0..25);
MATHEMATICA
Flatten[{0, Table[n! * (2*(n+1)*HarmonicNumber[n] - n - 3)/4, {n, 1, 25}]}] (* Vaclav Kotesovec, Apr 29 2017 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Apr 26 2017
STATUS
approved
