This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A214650 Number of distinct connected unicyclic bipartite graphs with n vertices. 1
 0, 0, 0, 1, 1, 5, 10, 34, 85, 254, 690, 1997, 5582, 15975, 45244, 129254, 368215, 1052961, 3010169, 8622273, 24709964, 70902886, 203594559, 585163116, 1683079071, 4844758076, 13955265122, 40225474849, 116021495035, 334843170810, 966929417619, 2793756318793 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS The graphs also have n edges. LINKS Andrew Howroyd, Table of n, a(n) for n = 1..200 Eric Weisstein's World of Mathematics, Unicyclic Graph EXAMPLE a(5)=1, a 4-cycle plus a pendant edge. PROG (PARI) \\ TreeGf gives gf of A000081 TreeGf(N)={my(A=vector(N, j, 1)); for (n=1, N-1, A[n+1] = 1/n * sum(k=1, n, sumdiv(k, d, d*A[d]) * A[n-k+1] ) ); x*Ser(A)} seq(n)={concat([0, 0, 0], if(n<4, [], my(t=TreeGf(n-2)); my(g(e)=subst(t + O(x*x^(n\e)), x, x^e) + O(x*x^n)); Vec(sum(k=2, n\2, sumdiv(2*k, d, eulerphi(d)*g(d)^(2*k/d))/k + (g(1)^2+g(2))*g(2)^(k-1))/4)))} \\ Andrew Howroyd, May 22 2018 CROSSREFS Cf. A001429. Sequence in context: A073705 A328130 A121158 * A032772 A326232 A189732 Adjacent sequences:  A214647 A214648 A214649 * A214651 A214652 A214653 KEYWORD nonn AUTHOR David Bevan, Jul 24 2012 EXTENSIONS Terms a(16) and beyond from Andrew Howroyd, May 22 2018 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 October 18 05:26 EDT 2019. Contains 328146 sequences. (Running on oeis4.)