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 A339045 #7 Feb 26 2023 13:41:56
%S A339045 1,1,4,16,69,307,1433,6903,34337,175457,919525,4931233,27023894,
%T A339045 151142376,861880778,5006906170,29611120248,178175786593,
%U A339045 1090266839041,6781364484106,42858210422338,275127506187149,1793418517202096,11867326044069470,79695273536227647
%N A339045 Number of connected loopless multigraphs with n edges rooted at two noninterchangeable vertices whose removal leaves a connected graph.
%F A339045 1/(Product_{k>=1} (1 - x^k)^a(k)) = f(x)/g(x)^2 where x*f(x) is the g.f. of A339037 and g(x) is the g.f. of A339036.
%o A339045 (PARI) \\ See A339065 for G.
%o A339045 InvEulerT(v)={my(p=log(1+x*Ser(v))); dirdiv(vector(#v,n,polcoef(p,n)), vector(#v,n,1/n))}
%o A339045 seq(n)={my(A=O(x*x^n), g=G(2*n, x+A,[]), gr=G(2*n, x+A,[1])/g); InvEulerT(Vec(-1+G(2*n, x+A, [1,1])/(g*gr^2)))}
%Y A339045 Cf. A338999, A339036, A339037, A339065.
%K A339045 nonn
%O A339045 1,3
%A A339045 _Andrew Howroyd_, Nov 25 2020