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.
%I A289951 #10 Jul 22 2017 09:23:11
%S A289951 15,315,4480,56672,703430,8941790,118685336,1658897240,24494859389,
%T A289951 382301179169,6302039460704,109568927676192,2005758201911884,
%U A289951 38588518087076860,778794884783432176,16458419973887378416,363578176719852275467,8381709371219530604071
%N A289951 Number of permutations of [n] having exactly three nontrivial cycles.
%C A289951 A nontrivial cycle has size > 1.
%H A289951 Alois P. Heinz, <a href="/A289951/b289951.txt">Table of n, a(n) for n = 6..450</a>
%H A289951 Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation">Permutation</a>
%F A289951 E.g.f.: (-log(1-x)-x)^3/3!*exp(x).
%t A289951 Drop [Range[0, 30]! CoefficientList[Series[(-Log[1 - x] - x)^3 / 3! Exp[x], {x, 0, 30}], x], 6] (* _Vincenzo Librandi_, Jul 22 2017 *)
%Y A289951 Column k=3 of A136394.
%K A289951 nonn
%O A289951 6,1
%A A289951 _Alois P. Heinz_, Jul 16 2017