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 A366758 #11 Oct 21 2023 16:01:54
%S A366758 3,3,4,8,31,133,832,5113,41044,388800,3958704,39916802,518682390,
%T A366758 6302045232,90968651712,1332614649600,22844265373440,356226551466344,
%U A366758 7504470340300800,123358411682195904,2432902126073962432,52279222588118377280,1175121515279802150144
%N A366758 a(n) is the sum of the divisors of n!+1.
%F A366758 a(n) = sigma(n!+1) = A000203(A038507(n)).
%e A366758 a(5) = 133 because the divisors of 5!+1 are {1, 11, 121}.
%p A366758 a:=n->numtheory[sigma](n!+1):
%p A366758 seq(a(n), n=0..30);
%t A366758 DivisorSigma[1,Range[0,25]!+1] (* _Paolo Xausa_, Oct 21 2023 *)
%o A366758 (Python)
%o A366758 from math import factorial
%o A366758 from sympy import divisor_sigma
%o A366758 def A366758(n): return divisor_sigma(factorial(n)+1) # _Chai Wah Wu_, Oct 20 2023
%Y A366758 Cf. A038507, A000203, A064144, A062569, A366757.
%K A366758 nonn
%O A366758 0,1
%A A366758 _Sean A. Irvine_, Oct 20 2023