|
|
A285231
|
|
Number of entries in the third cycles of all permutations of [n].
|
|
3
|
|
|
1, 8, 59, 463, 3978, 37566, 388728, 4385592, 53653680, 708126480, 10034314560, 152001161280, 2451821339520, 41964428419200, 759698874547200, 14505012898790400, 291323663566387200, 6140173922952652800, 135515391451776000000, 3125606951427609600000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,2
|
|
COMMENTS
|
Each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
a:= proc(n) option remember; `if`(n<4, [0$3, 1][n+1],
((2*n^3-7*n^2+3*n+4)*a(n-1)-(n-2)^3*(n+1)*a(n-2))/(n*(n-3)))
end:
seq(a(n), n=0..25);
|
|
MATHEMATICA
|
a[3] = 1; a[4] = 8;
a[n_] := a[n] = ((2n^3-7n^2+3n+4) a[n-1] - (n-2)^3 (n+1) a[n-2])/(n(n-3));
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|