

A286075


Number of permutations of [n] with increasing cycle sizes.


8



1, 1, 1, 3, 8, 38, 182, 1194, 7932, 69192, 591936, 6286272, 66914880, 840036960, 10567285920, 154755036000, 2246755924800, 37283584936320, 618705247829760, 11472473012232960, 212762383625594880, 4386435706887413760, 89954629722500659200, 2030764767987849062400
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,4


COMMENTS

Each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements.


LINKS



MAPLE

b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i>n, 0,
b(n, i+1)+b(ni, i+1)*(i1)!*binomial(n1, i1)))
end:
a:= n> b(n, 1):
seq(a(n), n=0..30);


MATHEMATICA

b[n_, i_] := b[n, i] = If[n == 0, 1, If[i > n, 0, b[n, i + 1] + b[n  i, i + 1]*(i  1)!*Binomial[n  1, i  1]]];
a[n_] := b[n, 1];


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



