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 A328681 #30 Sep 08 2022 08:46:24
%S A328681 1,6,20,55,142,322,779,1608,3894,7370,18372,33137,81512,149694,353224,
%T A328681 641461,1570836,2684928,6642915,11795178,28133846,46768200,125433400,
%U A328681 197654545,485749918,893864394,2066417482,3385115393,8975476976,14384181908,35478028091,61940000322
%N A328681 a(n) = Sum_{k=1..n} binomial(n,k) * tau(k) * tau(n - k + 1), where tau = A000005.
%F A328681 E.g.f.: (1/2) * d/dx (Sum_{k>=1} tau(k) * x^k / k!)^2.
%t A328681 Table[Sum[Binomial[n, k] DivisorSigma[0, k] DivisorSigma[0, n - k + 1], {k, 1, n}], {n, 1, 32}]
%t A328681 nmax = 32; CoefficientList[Series[(1/2) D[Sum[DivisorSigma[0, k] x^k/k!, {k, 1, nmax}]^2, x], {x, 0, nmax}], x] Range[0, nmax]! // Rest
%o A328681 (Magma) [&+[Binomial(n,k)*DivisorSigma(0,k)*DivisorSigma(0,n-k+1):k in [1..n]]:n in [1..32]]; // _Marius A. Burtea_, Dec 03 2019
%o A328681 (PARI) a(n) = sum(k=1, n, binomial(n,k)*numdiv(k)*numdiv(n-k+1)); \\ _Michel Marcus_, Dec 05 2019
%Y A328681 Cf. A000005, A007318, A055507, A160399, A330088.
%K A328681 nonn
%O A328681 1,2
%A A328681 _Ilya Gutkovskiy_, Dec 03 2019