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.

A289951 Number of permutations of [n] having exactly three nontrivial cycles.

Original entry on oeis.org

15, 315, 4480, 56672, 703430, 8941790, 118685336, 1658897240, 24494859389, 382301179169, 6302039460704, 109568927676192, 2005758201911884, 38588518087076860, 778794884783432176, 16458419973887378416, 363578176719852275467, 8381709371219530604071
Offset: 6

Views

Author

Alois P. Heinz, Jul 16 2017

Keywords

Comments

A nontrivial cycle has size > 1.

Crossrefs

Column k=3 of A136394.

Programs

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

Formula

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