login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A289951 Number of permutations of [n] having exactly three nontrivial cycles. 2
15, 315, 4480, 56672, 703430, 8941790, 118685336, 1658897240, 24494859389, 382301179169, 6302039460704, 109568927676192, 2005758201911884, 38588518087076860, 778794884783432176, 16458419973887378416, 363578176719852275467, 8381709371219530604071 (list; graph; refs; listen; history; text; internal format)
OFFSET

6,1

COMMENTS

A nontrivial cycle has size > 1.

LINKS

Alois P. Heinz, Table of n, a(n) for n = 6..450

Wikipedia, Permutation

FORMULA

E.g.f.: (-log(1-x)-x)^3/3!*exp(x).

MATHEMATICA

Drop [Range[0, 30]! CoefficientList[Series[(-Log[1 - x] - x)^3 / 3! Exp[x], {x, 0, 30}], x], 6] (* Vincenzo Librandi, Jul 22 2017 *)

CROSSREFS

Column k=3 of A136394.

Sequence in context: A284070 A133766 A347980 * A112489 A062757 A088913

Adjacent sequences:  A289948 A289949 A289950 * A289952 A289953 A289954

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Jul 16 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 04:10 EST 2021. Contains 349530 sequences. (Running on oeis4.)