|
|
A332853
|
|
Number of entries in the fourth cycles of all permutations of [n] when cycles are ordered by decreasing lengths.
|
|
3
|
|
|
1, 11, 101, 932, 9185, 98317, 1141614, 14297174, 192303794, 2767778378, 42482344932, 692989979996, 11977186926515, 218693683265139, 4207257180352118, 85067513019575426, 1803695291827381964, 40022639769763695724, 927602835889551674104, 22416055484058795043176
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
4,2
|
|
LINKS
|
|
|
MAPLE
|
b:= proc(n, l) option remember; `if`(n=0, l[4], add((j-1)!*b(n-j,
sort([l[], j], `>`)[1..4])*binomial(n-1, j-1), j=1..n))
end:
a:= n-> b(n, [0$4]):
seq(a(n), n=4..24);
|
|
MATHEMATICA
|
b[n_, l_] := b[n, l] = If[n == 0, l[[4]], Sum[(j-1)! b[n-j, ReverseSort[ Append[l, j]][[1 ;; 4]]] Binomial[n - 1, j - 1], {j, 1, n}]];
a[n_] := b[n, {0, 0, 0, 0}];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|