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 A338788 #16 Nov 10 2020 02:19:13
%S A338788 0,0,1,6,95,585,8974,70252,1178540,10683180,201213936,2151034776,
%T A338788 46320457248,557515105056,12980593545984,179077693449600,
%U A338788 4696518067511040,71418673681171200,2026061283912560640,33687422807179092480,1055027603388725452800,19337685190135751577600
%N A338788 a(n) = (n!/6) * Sum_{i,j,k > 0 and i+j+k=n} A000593(i)*A000593(j)*A000593(k)/(i*j*k).
%H A338788 Seiichi Manyama, <a href="/A338788/b338788.txt">Table of n, a(n) for n = 1..448</a>
%t A338788 nmax = 50; A000593 = Table[Sum[Mod[d, 2] d, {d, Divisors[n]}], {n, 1, nmax}]; Table[n!/6 * Sum[Sum[Sum[If[i + j + k == n, A000593[[i]] * A000593[[j]] * A000593[[k]] / (i*j*k), 0], {k, 1, n}], {j, 1, n}], {i, 1, n}], {n, 1, nmax}] (* _Vaclav Kotesovec_, Nov 09 2020 *)
%o A338788 (PARI) {a(n) = my(t='t); n!*polcoef(polcoef(prod(k=1, n, (1+x^k+x*O(x^n))^t), n), 3)}
%Y A338788 Column 3 of A075525.
%Y A338788 Cf. A000593, A059357.
%K A338788 nonn
%O A338788 1,4
%A A338788 _Seiichi Manyama_, Nov 09 2020