Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Feb 26 2023 14:39:29
%S 1,2,7,23,88,339,1396,5915,26080,118539,555678,2678458,13262193,
%T 67353325,350493424,1866989802,10171394388,56631507822,322011612423,
%U 1868702977253,11061267210030,66745602611831,410360493588788,2569318971123439,16374787277199728,106180292431149021
%N Number of unlabeled connected loopless multigraphs with n edges rooted at one unoriented edge.
%F G.f.: x*f(x)/g(x) where f(x) is the g.f. of A339066 and g(x) is the g.f. of A050535.
%t seq[n_] := (G[2n, x + O[x]^n, {1, 1}] + G[2n, x + O[x]^n, {2}])/G[2n, x + O[x]^n, {}] // CoefficientList[#/2, x]&;
%t seq[15] (* _Jean-François Alcover_, Dec 02 2020, after _Andrew Howroyd_'s code for G in A339065 *)
%o (PARI) \\ See A339065 for G.
%o seq(n)={my(A=O(x*x^n)); Vec((G(2*n, x+A, [1,1]) + G(2*n, x+A, [2]))/G(2*n, x+A, []))/2}
%Y Cf. A050535, A076864, A303832, A339036, A339037, A339042, A339043, A339065, A339066.
%K nonn
%O 1,2
%A _Andrew Howroyd_, Nov 20 2020