login

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”).

A339039
Number of unlabeled connected simple graphs with n edges rooted at one distinguished vertex.
5
1, 1, 2, 5, 13, 37, 114, 367, 1248, 4446, 16526, 63914, 256642, 1067388, 4590201, 20376849, 93240065, 439190047, 2126970482, 10579017047, 53983000003, 282345671127, 1512273916781, 8287870474339, 46438619162441, 265840311066579
OFFSET
0,3
FORMULA
G.f.: f(x)/g(x) where f(x) is the g.f. of A053419 and g(x) is the g.f. of A000664.
PROG
(PARI) \\ See A339063 for G.
seq(n)={my(A=O(x*x^n)); Vec(G(2*n, x+A, [1])/G(2*n, x+A, []))}
KEYWORD
nonn
AUTHOR
Andrew Howroyd, Nov 20 2020
STATUS
approved