|
|
A332851
|
|
Number of entries in the second cycles of all permutations of [n] when cycles are ordered by decreasing lengths.
|
|
3
|
|
|
1, 4, 21, 131, 950, 7694, 70343, 709015, 7867174, 94945874, 1241471451, 17442660795, 262748183438, 4215551220698, 71873188059263, 1296535610096063, 24690833276595022, 494624740502491786, 10406110949475668267, 229244825016301188267, 5280217980442316367510
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
b:= proc(n, l) option remember; `if`(n=0, l[2], add((j-1)!*b(n-j,
sort([l[], j], `>`)[1..2])*binomial(n-1, j-1), j=1..n))
end:
a:= n-> b(n, [0$2]):
seq(a(n), n=2..23);
|
|
MATHEMATICA
|
b[n_, l_] := b[n, l] = If[n == 0, l[[2]], Sum[(j-1)! b[n-j, ReverseSort[ Append[l, j]][[1 ;; 2]]] Binomial[n - 1, j - 1], {j, 1, n}]];
a[n_] := b[n, {0, 0}];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|