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.

A289952 Number of permutations of [n] having exactly four nontrivial cycles.

Original entry on oeis.org

105, 3465, 74025, 1346345, 23079595, 391180075, 6719395683, 118538975555, 2163255564470, 40995539853814, 808279043604630, 16591622809290774, 354584560193653306, 7886213669622441146, 182405117548079061482, 4383906242299647034026, 109380730176142312738279
Offset: 8

Views

Author

Alois P. Heinz, Jul 16 2017

Keywords

Comments

A nontrivial cycle has size > 1.

Crossrefs

Column k=4 of A136394.

Programs

  • Mathematica
    Drop[Range[0, 30]! CoefficientList[Series[(Log[1 - x] + x)^4 / 4! Exp[x], {x, 0, 30}], x], 8] (* Vincenzo Librandi, Jul 23 2017 *)

Formula

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