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.

A289955 Number of permutations of [n] having exactly seven nontrivial cycles.

Original entry on oeis.org

135135, 11486475, 583783200, 23434451040, 828052325100, 27221423409180, 859752405431920, 26617555964919920, 818486200464162230, 25221598500336187950, 783666055857936771520, 24658659357394687609600, 788174700361283653718300, 25647112073453527447490700
Offset: 14

Views

Author

Alois P. Heinz, Jul 16 2017

Keywords

Comments

A nontrivial cycle has size > 1.

Crossrefs

Column k=7 of A136394.

Programs

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

Formula

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