The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A038095 Number of rooted connected graphs on n labeled nodes where the root has degree 2. 4
 6, 72, 1440, 49680, 2998800, 324237312, 64440883584, 24059497893120, 17143668999705600, 23569875858252303360, 63000019679242001900544, 329150325651711743768150016, 3374625529825460904919664793600, 68094821953233373962606732799672320 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,1 LINKS Andrew Howroyd, Table of n, a(n) for n = 3..50 FORMULA E.g.f.: B(x)/C(x) where B, C resp E.g.f.'s of A038094 and A006125. PROG (PARI) seq(n)={Vec(serlaplace(sum(k=1, n, k*binomial(k-1, 2)*2^binomial(k-1, 2)*x^k/k!)/sum(k=0, n, 2^binomial(k, 2)*x^k/k!) + O(x*x^n)))} \\ Andrew Howroyd, Nov 23 2020 CROSSREFS Cf. A038094, A038096, A038097. Sequence in context: A089252 A052730 A010796 * A012242 A138446 A099029 Adjacent sequences:  A038092 A038093 A038094 * A038096 A038097 A038098 KEYWORD nonn,easy,changed AUTHOR Christian G. Bower, Jan 04 1999; suggested by Vlady Ravelomanana EXTENSIONS Terms a(12) and beyond corrected by Andrew Howroyd, Nov 23 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 26 16:51 EST 2020. Contains 338641 sequences. (Running on oeis4.)