login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
Wikipedia, Permutation
MAPLE
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i>n, 0,
b(n, i+1)+b(n-i, i+1)*(i-1)!*binomial(n-1, i-1)))
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];
Table[a[n], {n, 0, 30}] (* Jean-François Alcover, May 28 2018, from Maple *)
CROSSREFS
Sequence in context: A123981 A123985 A219953 * A089066 A099030 A264657
KEYWORD
nonn
AUTHOR
Alois P. Heinz, May 01 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 23:17 EST 2023. Contains 367526 sequences. (Running on oeis4.)