proposed
approved
proposed
approved
editing
proposed
seq[n_] := Module[{A = O[x]^n}, G[2n, x+A, {1}] // CoefficientList[#, x]&]; (* _Jean-François Alcover_, Dec 03 2020, using _Andrew Howroyd_'s code for g.f. G in A339063 *)
(* Jean-François Alcover, Dec 03 2020, using Andrew Howroyd's code for g.f. G in A339063 *)
proposed
editing
editing
proposed
seq[n_] := Module[{A = O[x]^n}, G[2n, x+A, {1}] // CoefficientList[#, x]&];
(* Jean-François Alcover, Dec 03 2020, using Andrew Howroyd's code for g.f. G in A339063 *)
approved
editing
proposed
approved
editing
proposed
a(n) is the number of unlabeled simple graphs with n edges rooted at one vertex. - Andrew Howroyd, Nov 22 2020
(PARI) \\ See A339063 for G.
seq(n)={my(A=O(x*x^n)); Vec(G(2*n, x+A, [1]))} \\ Andrew Howroyd, Nov 22 2020
approved
editing
editing
approved