cp's OEIS Frontend

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.

A339039 Number of unlabeled connected simple graphs with n edges rooted at one distinguished vertex.

This page as a plain text file.
%I A339039 #8 Nov 26 2020 22:25:23
%S A339039 1,1,2,5,13,37,114,367,1248,4446,16526,63914,256642,1067388,4590201,
%T A339039 20376849,93240065,439190047,2126970482,10579017047,53983000003,
%U A339039 282345671127,1512273916781,8287870474339,46438619162441,265840311066579
%N A339039 Number of unlabeled connected simple graphs with n edges rooted at one distinguished vertex.
%F A339039 G.f.: f(x)/g(x) where f(x) is the g.f. of A053419 and g(x) is the g.f. of A000664.
%o A339039 (PARI) \\ See A339063 for G.
%o A339039 seq(n)={my(A=O(x*x^n)); Vec(G(2*n, x+A, [1])/G(2*n, x+A, []))}
%Y A339039 Cf. A000664, A002905, A053419, A126100, A303832, A339036, A339040, A339041, A339044, A339063.
%K A339039 nonn
%O A339039 0,3
%A A339039 _Andrew Howroyd_, Nov 20 2020