|
|
A179973
|
|
Number of permutations of [n] whose cycle lengths are nondecreasing when cycles are ordered by their minima and these minima are {1..k} (for some k <= n).
|
|
6
|
|
|
1, 1, 2, 4, 12, 42, 216, 1200, 8664, 66384, 612264, 5910024, 66723384, 776642664, 10311400344, 141065450904, 2153769250584, 33743736435864, 583781959921944, 10308436641381144, 198863818304824344, 3914117125411211544, 83301822014343774744, 1805447764831655109144
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Sum_{lambda in partitions(n)} (n - |lambda|)!.
|
|
EXAMPLE
|
a(4) = 12 = 6 + 2 + 2 + 1 + 1: (1234), (1243), (1324), (1342), (1423), (1432),
(13)(24), (14)(23), (1)(234), (1)(243), (1)(2)(34), (1)(2)(3)(4).
|
|
MAPLE
|
a:= n-> add((n-nops(p))!, p=combinat[partition](n)):
# second Maple program:
b:= proc(n, i, p) option remember; `if`(n=0 or i=1,
(p-n)!, b(n, i-1, p)+b(n-i, min(n-i, i), p-1))
end:
a:= n-> b(n$3):
|
|
MATHEMATICA
|
b[n_, i_, p_] := b[n, i, p] = If[n == 0 || i == 1, (p - n)!, b[n, i - 1, p] + b[n - i, Min[n - i, i], p - 1]];
a[n_] := b[n, n, n];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|