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.

A289956 Number of permutations of [n] having exactly eight nontrivial cycles.

Original entry on oeis.org

2027025, 218243025, 13818229425, 680438103345, 29079209884725, 1141483113695925, 42556765607801445, 1539279211706361125, 54789078082648965055, 1938102614993339970175, 68612592434209034386175, 2443274471026078967051775, 87839862102761225799417075
Offset: 16

Views

Author

Alois P. Heinz, Jul 16 2017

Keywords

Comments

A nontrivial cycle has size > 1.

Crossrefs

Column k=8 of A136394.

Programs

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

Formula

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