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 A332853 #11 Mar 02 2020 08:42:15
%S A332853 1,11,101,932,9185,98317,1141614,14297174,192303794,2767778378,
%T A332853 42482344932,692989979996,11977186926515,218693683265139,
%U A332853 4207257180352118,85067513019575426,1803695291827381964,40022639769763695724,927602835889551674104,22416055484058795043176
%N A332853 Number of entries in the fourth cycles of all permutations of [n] when cycles are ordered by decreasing lengths.
%H A332853 Alois P. Heinz, <a href="/A332853/b332853.txt">Table of n, a(n) for n = 4..450</a>
%H A332853 Andrew V. Sills, <a href="https://arxiv.org/abs/1912.05306">Integer Partitions Probability Distributions</a>, arXiv:1912.05306 [math.CO], 2019.
%H A332853 Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation">Permutation</a>
%p A332853 b:= proc(n, l) option remember; `if`(n=0, l[4], add((j-1)!*b(n-j,
%p A332853 sort([l[], j], `>`)[1..4])*binomial(n-1, j-1), j=1..n))
%p A332853 end:
%p A332853 a:= n-> b(n, [0$4]):
%p A332853 seq(a(n), n=4..24);
%t A332853 b[n_, l_] := b[n, l] = If[n == 0, l[[4]], Sum[(j-1)! b[n-j, ReverseSort[ Append[l, j]][[1 ;; 4]]] Binomial[n - 1, j - 1], {j, 1, n}]];
%t A332853 a[n_] := b[n, {0, 0, 0, 0}];
%t A332853 a /@ Range[4, 24] (* _Jean-François Alcover_, Mar 01 2020, after _Alois P. Heinz_ *)
%Y A332853 Column k=4 of A322384.
%K A332853 nonn
%O A332853 4,2
%A A332853 _Alois P. Heinz_, Feb 26 2020