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 A332859 #11 Mar 02 2020 07:03:33
%S A332859 1,56,1992,58566,1569387,40210458,1011778943,25407870031,643294838111,
%T A332859 16530707226038,433032539982493,11597633757170403,318186179384754262,
%U A332859 8953723541105483282,258628065642282683675,7671629851218367059371,233734404206144319940526
%N A332859 Number of entries in the tenth cycles of all permutations of [n] when cycles are ordered by decreasing lengths.
%H A332859 Alois P. Heinz, <a href="/A332859/b332859.txt">Table of n, a(n) for n = 10..450</a>
%H A332859 Andrew V. Sills, <a href="https://arxiv.org/abs/1912.05306">Integer Partitions Probability Distributions</a>, arXiv:1912.05306 [math.CO], 2019.
%H A332859 Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation">Permutation</a>
%p A332859 b:= proc(n, l) option remember; `if`(n=0, l[10], add((j-1)!*b(n-j,
%p A332859 sort([l[], j], `>`)[1..10])*binomial(n-1, j-1), j=1..n))
%p A332859 end:
%p A332859 a:= n-> b(n, [0$10]):
%p A332859 seq(a(n), n=10..27);
%t A332859 b[n_, l_] := b[n, l] = If[n == 0, l[[10]], Sum[(j-1)!*b[n-j, ReverseSort[ Append[l, j]][[1 ;; 10]]] Binomial[n - 1, j - 1], {j, 1, n}]];
%t A332859 a[n_] := b[n, Table[0, {10}]];
%t A332859 a /@ Range[10, 27] (* _Jean-François Alcover_, Mar 01 2020, after _Alois P. Heinz_ *)
%Y A332859 Column k=10 of A322384.
%K A332859 nonn
%O A332859 10,2
%A A332859 _Alois P. Heinz_, Feb 26 2020