login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A289953
Number of permutations of [n] having exactly five nontrivial cycles.
2
945, 45045, 1344420, 33093060, 745860115, 16201119935, 348820952480, 7567361882080, 167057902281270, 3775807346835342, 87699348621850680, 2098002630307972920, 51760647309783259386, 1317835530989933266850, 34632875559239201852608, 939407586052413176727424
OFFSET
10,1
COMMENTS
A nontrivial cycle has size > 1.
LINKS
Wikipedia, Permutation
FORMULA
E.g.f.: (-log(1-x)-x)^5/5!*exp(x).
MATHEMATICA
Drop[Range[0, 30]! CoefficientList[Series[(-Log[1 - x] - x)^5 / 5! Exp[x], {x, 0, 30}], x], 10] (* Vincenzo Librandi, Jul 23 2017 *)
CROSSREFS
Column k=5 of A136394.
Sequence in context: A133818 A334973 A334975 * A112491 A263889 A133353
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Jul 16 2017
STATUS
approved