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 A052170 #12 Mar 16 2020 22:16:18
%S A052170 1,1,6,24,130,688,4211,26840,184153,1328155,10078617,79926478,
%T A052170 660616432,5671793248,50459837996,464139053799,4405521306315,
%U A052170 43077862741114,433275511964227,4476516495577776,47451864583578111,515494036824348917,5733423512317010811,65226494052113260251,758377712833720838677,9004484581478188581057
%N A052170 Number of directed loopless multigraphs with n arcs.
%H A052170 Andrew Howroyd, <a href="/A052170/b052170.txt">Table of n, a(n) for n = 0..50</a>
%F A052170 a(n) = A333361(n, 2*n). - _Andrew Howroyd_, Mar 16 2020
%o A052170 (PARI) a(n)={polcoef(G(2*n, x + O(x*x^(n))), n)} \\ Needs G from A333361. - _Andrew Howroyd_, Mar 16 2020
%o A052170 (PARI) \\ faster, also needs G from A333361.
%o A052170 EulerT(v)={Vec(exp(x*Ser(dirmul(v,vector(#v,n,1/n))))-1, -#v)}
%o A052170 InvEulerMT(u)={my(n=#u, p=log(1+x*Ser(u)), vars=variables(p)); Vec(sum(i=1, n, moebius(i)*substvec(p + O(x*x^(n\i)), vars, apply(v->v^i, vars))/i))}
%o A052170 seq(n)={concat([1], EulerT(Vec(-1 + vecsum(InvEulerMT(vector(n+1, k, G(k, y + O(y*y^n))))))))} \\ _Andrew Howroyd_, Mar 16 2020
%Y A052170 Cf. A050535, A007717, A037240, A050930, A333361.
%K A052170 nonn
%O A052170 0,3
%A A052170 _Vladeta Jovovic_, Jan 26 2000
%E A052170 a(16)-a(25) from _Max Alekseyev_, Jun 21 2011