cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A289958 Number of permutations of [n] having exactly ten nontrivial cycles.

Original entry on oeis.org

654729075, 105411381075, 9729928783575, 682187321190375, 40619713503218850, 2178070341434237250, 108946451099337101250, 5201416870471272701250, 240786076823686096077375, 10929696310323023478019775, 490470855046984824670532875, 21893162839119896036432594875
Offset: 20

Views

Author

Alois P. Heinz, Jul 16 2017

Keywords

Comments

A nontrivial cycle has size > 1.

Crossrefs

Column k=10 of A136394.

Programs

  • Mathematica
    Drop[CoefficientList[Series[(Log[1 - x] + x)^10/10!*Exp[x] , {x, 0, 50}], x] * Table[k!, {k, 0, 50}] , 20] (* Indranil Ghosh, Jul 16 2017 *)
  • PARI
    x = 'x + O('x^30); Vec(serlaplace((-log(1-x)-x)^10/10!*exp(x))) \\ Michel Marcus, Jul 16 2017

Formula

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